2021.02.03

Author: seono

python/plat3/11014.py

@@ -0,0 +1,33 @@
+import sys
+input = sys.stdin.readline
+T = int(input())
+d = [(-1,-1),(0,-1),(1,-1),(-1,1),(0,1),(1,1)]
+def dfs(idx):
+    if visited[idx]:return False
+    visited[idx]=True
+    for nx in adj[idx]:
+        if p[nx]==-1 or dfs(p[nx]):
+            p[nx]=idx
+            return True
+    return False
+while T:
+    T-=1
+    N, M = map(int,input().split())
+    arr = [list(input().strip()) for _ in range(N)]
+    adj = [[] for _ in range(6401)]
+    p = [-1]*6401
+    total = 0
+    for x in range(M):
+        for y in range(N):
+            if arr[y][x]=='x':continue
+            total+=1
+            if x%2:continue
+            for dy,dx in d:
+                ny,nx = y+dy,x+dx
+                if 0<=ny<N and 0<=nx<M and arr[ny][nx]=='.':
+                    adj[y*80+x].append(ny*80+nx)
+    ans = 0
+    for i in range(6401):
+        visited = [False]*6401
+        if dfs(i):ans+=1
+    print(total-ans)

python/plat3/2152.py

@@ -0,0 +1,70 @@
+import sys
+from collections import deque
+sys.setrecursionlimit(100000)
+input = sys.stdin.readline
+
+N, M, S, T = map(int,input().split())
+adj = [[] for _ in range(N+1)]
+for i in range(M):
+    s,t = map(int,input().split())
+    adj[s].append(t)
+cnt,SN = 0,0
+dfsn = [0]*(N+1)
+scc_arr = []
+scc_num = [0]*(N+1)
+finished = [False]*(N+1)
+st = []
+
+def scc(idx):
+    global cnt,SN
+    dfsn[idx] = cnt+1
+    cnt+=1
+    st.append(idx)
+    result = dfsn[idx]
+    for nx in adj[idx]:
+        if dfsn[nx]==0:result = min(result,scc(nx))
+        elif not finished[nx]: result = min(result, dfsn[nx])
+
+    if result == dfsn[idx]:
+        curSCC = []
+        while True:
+            t = st.pop()
+            curSCC.append(t)
+            finished[t]=True
+            scc_num[t]=SN
+            if t==idx:break
+        scc_arr.append(curSCC)
+        SN+=1
+    return result
+
+for i in range(1,N+1):
+    if dfsn[i]==0:scc(i)
+new_adj = [[] for _ in range(SN)]
+indgree = [0]*SN
+finished = [0]*SN
+new_s,new_t = scc_num[S],scc_num[T]
+for i,tmp in enumerate(scc_arr):
+    for n in tmp:
+        for nx in adj[n]:
+            if scc_num[nx]==i:continue
+            new_adj[i].append(scc_num[nx])
+            indgree[scc_num[nx]]+=1
+def dfs():
+    st = deque([new_s])
+    can = [False]*SN
+    can[new_s]=True
+    finished[new_s]=len(scc_arr[new_s])
+    q = deque([])
+    for i in range(SN):
+        if not indgree[i]: q.append(i)
+    while q:
+        n = q.popleft()
+        for nx in new_adj[n]:
+            if can[n]:
+                finished[nx]=max(finished[nx],finished[n]+len(scc_arr[nx]))
+                can[nx]=True
+            indgree[nx]-=1
+            if indgree[nx]==0:
+                q.append(nx)
+    return finished[new_t]
+print(dfs())

python/plat3/2912.py

@@ -0,0 +1,66 @@
+import sys
+import bisect
+input = sys.stdin.readline
+output = sys.stdout.write
+N, C = map(int,input().split())
+st = 1
+while st<N:
+    st<<=1
+tree = [[] for _ in range(st<<1)]
+tmp = st
+flag = [-1]*(st<<1)
+for i,num in enumerate(list(map(int,input().split())),st):
+    tree[i]=[num]
+    flag[i]=num
+while tmp>1:
+    ed = tmp
+    tmp = tmp>>1
+    for i in range(tmp,ed):
+        l,r=0,0
+        left,right = len(tree[i<<1]),len(tree[i<<1|1])
+        while l<left or r<right:
+            if r==right or (l<left and tree[i<<1][l]<tree[i<<1|1][r]):
+                tree[i].append(tree[i<<1][l])
+                l+=1
+            else:
+                tree[i].append(tree[i<<1|1][r])
+                r+=1
+        n = 0
+        x = len(tree[i])/2
+        for num in set(tree[i]):
+            l = bisect.bisect_left(tree[i],num)
+            r = bisect.bisect_right(tree[i],num)
+            if r-l>x:
+                flag[i]=num
+                break
+def query(node,ns,ne,s,e):
+    if ne<s or ns>e:return []
+    if s<=ns and ne<=e:
+        if flag[node]>0:
+            return [flag[node]]
+        return []
+    mid = (ns+ne)>>1
+    return query(node<<1,ns,mid,s,e)+query(node<<1|1,mid+1,ne,s,e)
+
+def query2(node,ns,ne,s,e, num):
+    if ne<s or ns>e:return 0
+    if s<=ns and ne<=e:
+        return bisect.bisect_right(tree[node],num)-bisect.bisect_left(tree[node],num)
+    mid = (ns+ne)>>1
+    return query2(node<<1,ns,mid,s,e,num)+query2(node<<1|1,mid+1,ne,s,e,num)
+
+
+M = int(input())
+
+for i in range(M):
+    a,b = map(int,input().split())
+    p_list = query(1,1,st,a,b)
+    total = b-a+1
+    check = True
+    for num in p_list:
+        if query2(1,1,st,a,b,num)>total/2:
+            output("yes %d\n"%num)
+            check = False
+            break
+    if check:
+        output("no\n")