2021.01.13

Author: seono

python/plat4/10999.py

@@ -0,0 +1,41 @@
+import sys
+input = sys.stdin.readline
+print = sys.stdout.write
+N, M, K = map(int,input().split())
+a_tree = [0]*(N+2)
+b_tree = [0]*(N+2)
+def update(tree,idx,diff):
+    while idx<N+1:
+        tree[idx]+=diff
+        idx+=(idx&-idx)
+def get(a,b):
+    def getIdx(idx):
+        ret = 0
+        ret2 = 0
+        tmp = idx
+        while idx>0:
+            ret+=a_tree[idx]
+            ret2+=b_tree[idx]
+            idx-=(idx&-idx)
+        return ret*tmp+ret2
+    return getIdx(b)-getIdx(a-1)
+    
+p=0
+def rangeUpdate(L,R,diff):
+    update(a_tree, L,diff)
+    update(a_tree, R+1,-diff)
+    update(b_tree, L,(-L+1)*diff)
+    update(b_tree, R+1,R*diff)
+
+
+for idx in range(1,N+1):
+    n = int(input())
+    rangeUpdate(idx,idx,n)
+for _ in range(M+K):
+    row = list(map(int,input().split()))
+    L,R = row[1],row[2]
+    if L>R:L,R=R,L
+    if row[0]==1:
+        rangeUpdate(L,R,row[3])
+    else:
+        print("%d\n"%get(L,R))

python/plat4/11375.py

@@ -0,0 +1,23 @@
+import sys
+input = sys.stdin.readline
+
+N, M = map(int,input().split())
+arr = [[]]
+
+def bfs(idx):
+    visited[idx]=True
+    for nx in arr[idx]:
+        if p[nx]==-1 or (not visited[p[nx]] and bfs(p[nx])):
+            p[nx]=idx
+            return True
+    return False
+
+p = [-1]*(M+1)
+for _ in range(N):
+    arr.append(list(map(int,input().split()))[1:])
+ans = 0
+for idx in range(1,N+1):
+    visited = [False]*(N+1)
+    if bfs(idx):ans+=1
+
+print(ans)

python/plat4/5419.py

@@ -0,0 +1,39 @@
+import sys
+input = sys.stdin.readline
+T = int(input())
+
+def update(idx):
+    idx+=size//2
+    while idx>0:
+        tree[idx]+=1
+        idx=idx//2
+
+def sum(s,e,node,ns,ne):
+    if(e<=ns or ne<=s):return 0
+    if(s<=ns and ne<=e):return tree[node]
+    mid = (ns+ne)//2
+    return sum(s,e,node*2,ns,mid)+sum(s,e,node*2+1,mid,ne)
+
+while T:
+    T-=1
+    n = int(input())
+    size = 1<<18
+    arr = [list(map(int,input().split())) for _ in range(n)]
+    tree = [0]*size
+    arr.sort(key = lambda x : (x[1]))
+    r = 0
+    newY = [0]*n
+    for i in range(n):
+        if i>0 and arr[i][1]!=arr[i-1][1]:r+=1
+        newY[i]=r
+    
+    for i in range(n):
+        arr[i][1]=newY[i]
+    arr.sort(key = lambda x:(x[0],-x[1]))
+    ans = 0
+
+    for i in range(n):
+        ans+=sum(arr[i][1],size//2,1,0,size//2)
+        update(arr[i][1])
+    
+    print(ans)