2021.04.20

Author: seono

python/gold1/17435.py

@@ -0,0 +1,26 @@
+import sys
+input = sys.stdin.readline
+output = sys.stdout.write
+
+m = int(input())
+arr = list(map(int, input().split()))
+LCarr = [[0]*21 for _ in range(m+1)]
+
+for i,num in enumerate(arr,1):
+    LCarr[i][0] = num
+
+for y in range(1,21):
+    for x in range(1,m+1):
+        LCarr[x][y] = LCarr[LCarr[x][y-1]][y-1]
+
+def sol(n,x):
+    for i in range(20,-1,-1):
+        if n>=1<<i:
+            n-=(1<<i)
+            x = LCarr[x][i]
+    return x
+
+
+for i in range(int(input())):
+    n,x = map(int,input().split())
+    output("%d\n"%sol(n,x))

python/plat2/13263.py

@@ -0,0 +1,42 @@
+import sys
+input = sys.stdin.readline
+output = sys.stdout.write
+
+class Line(object):
+    def __init__(self,p,c):
+        self.p = p
+        self.c = c
+        self.s = 0
+
+def cross(l1,l2):
+    return (l1.c-l2.c)/(l2.p-l1.p)
+
+n = int(input())
+tree_height = list(map(int,input().split()))
+tree_p = list(map(int,input().split()))
+dp_arr = [-1]*(n+1)
+dp_arr[0] = 0
+st = [None]*(n+1)
+top = 0
+
+for i in range(1,n):
+    l = Line(tree_p[i-1],dp_arr[i-1])
+    while top>0:
+        l.s = cross(st[top-1],l)
+        if st[top-1].s<l.s: break;
+        top-=1
+    st[top] = l
+    top+=1
+    x = tree_height[i]
+    idx = top-1
+    if x<st[idx].s:
+        l,r = 0,idx
+        while l+1<r:
+            mid = (l+r)>>1
+            if x<st[mid].s:
+                r = mid
+            else:
+                l = mid
+        idx = l
+    dp_arr[i] = st[idx].p*x + st[idx].c
+print(dp_arr[n-1])

python/plat4/16975.py

@@ -0,0 +1,57 @@
+import sys
+input = sys.stdin.readline
+output = sys.stdout.write
+
+N = int(input())
+st = 1
+while st<=N:
+    st<<=1
+tree = [0]*(st<<1)
+lazy = [0]*(st<<1)
+
+for idx,num in enumerate(list(map(int,input().split()))):
+    tree[idx+st] = num
+
+temp = st
+while temp>1:
+    ed = temp
+    temp>>=1
+    for idx in range(temp,ed):
+        tree[idx] = tree[idx<<1]+tree[idx<<1|1]
+
+def propagate(node, ns, ne):
+    if lazy[node]:
+        tree[node] +=lazy[node]
+        if ns!=ne:
+            lazy[node<<1] += lazy[node]
+            lazy[node<<1|1] += lazy[node]
+        lazy[node] = 0
+
+def update(ns,ne,s,e,node,k):
+    propagate(node,ns,ne)
+    if ns>e or ne<s : return
+    if s<=ns and ne<=e:
+        tree[node]+=k
+        if ns!=ne:
+            lazy[node<<1]+=k
+            lazy[node<<1|1]+=k
+        return
+    mid = (ns+ne)>>1
+    update(ns,mid,s,e,node<<1,k)
+    update(mid+1,ne,s,e,node<<1|1,k)
+    tree[node]=tree[node<<1]+tree[node<<1|1]
+
+def query(ns,ne,s,e,node):
+    propagate(node,ns,ne)
+    if e<ns or s>ne: return 0
+    if s<=ns and ne<=e: return tree[node]
+    mid = (ne+ns)>>1
+    return query(ns,mid,s,e,node<<1) + query(mid+1,ne,s,e,node<<1|1)
+
+M = int(input())
+for i in range(M):
+    row = list(map(int,input().split()))
+    if row[0]==1:
+        update(1,st,row[1],row[2],1,row[3])
+    else:
+        output("%d\n"%query(1,st,row[1],row[1],1))