2021.01.30

Author: seono

python/plat3/1006.py

@@ -0,0 +1,55 @@
+import sys
+input = sys.stdin.readline
+
+e = [[0,0] for _ in range(10001)]
+a = [0]*10001
+b = [0]*10001
+c = [0]*10001
+
+def sol(st):
+    global N,W
+    for i in range(st,N):
+        a[i+1]=min(b[i]+1,c[i]+1)
+        if e[i][0] + e[i][1]<=W:
+            a[i+1]=min(a[i+1],a[i]+1)
+        if i>0 and e[i-1][0]+e[i][0]<=W and e[i-1][1]+e[i][1]<=W:
+            a[i+1]=min(a[i+1],a[i-1]+2)
+        if i<N-1:
+            b[i+1] = a[i+1]+1
+            if e[i][0]+e[i+1][0]<=W:
+                b[i+1] = min(b[i+1],c[i]+1)
+            c[i+1] = a[i+1]+1
+            if e[i][1]+e[i+1][1]<=W:
+                c[i+1] = min(c[i+1],b[i]+1)
+T = int(input())
+while T:
+    T-=1
+    N , W = map(int,input().split())
+    for i,num in enumerate(list(map(int,input().split()))):
+        e[i][0]=num
+    for i,num in enumerate(list(map(int,input().split()))):
+        e[i][1]=num
+    a[0]=0
+    b[0]=1
+    c[0]=1
+    sol(0)
+    res = min(1e9,a[N])
+    if N>1 and e[0][0]+e[N-1][0]<=W:
+        a[1] = 1
+        b[1] = 2
+        c[1] = 1 if e[0][1]+e[1][1]<=W else 2
+        sol(1)
+        res = min(res,c[N-1]+1)
+    if N>1 and e[0][1]+e[N-1][1]<=W:
+        a[1] = 1
+        b[1] = 1 if e[0][0]+e[1][0]<=W else 2
+        c[1] = 2
+        sol(1)
+        res = min(res,b[N-1]+1)
+    if N>1 and e[0][0]+e[N-1][0]<=W and e[0][1]+e[N-1][1]<=W:
+        a[1] = 0
+        b[1], c[1] = 1,1
+        sol(1)
+        res = min(res,a[N-1]+2)
+    print(res)
+    

python/plat3/12844.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*2)
+temp = st
+tree[st:st+N] = list(map(int,input().split()))
+while temp>1:
+    ed = temp
+    temp = temp>>1
+    for i in range(temp,ed):
+        tree[i]=tree[i<<1]^tree[i<<1|1]
+lazy = [0]*(st*2)
+
+def propagate(node, ns, ne):
+    if lazy[node]:
+        if (ne-ns+1)%2:
+            tree[node]^=lazy[node]
+        if ns!=ne:
+            lazy[node<<1]^=lazy[node]
+            lazy[node<<1|1]^=lazy[node]
+        lazy[node]=0
+    return
+
+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:
+        if (ne-ns+1)%2:
+            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)
+
+for _ in range(int(input())):
+    row = list(map(int,input().split()))
+    if row[0]==1:
+        update(1,st,row[1]+1,row[2]+1,1,row[3])
+    else:
+        output("%d\n"%query(1,st,row[1]+1,row[2]+1,1))

python/plat3/1867.py

@@ -0,0 +1,25 @@
+import sys
+input = sys.stdin.readline
+
+n, k = map(int,input().split())
+
+adj = [[] for _ in range(n)]
+for _ in range(k):
+    y,x = map(int,input().split())
+    adj[y-1].append(x-1)
+
+p = [-1]*(n)
+
+def bfs(idx):
+    visited[idx]=True
+    for nx in adj[idx]:
+        if p[nx]==-1 or (not visited[p[nx]] and bfs(p[nx])):
+            p[nx]=idx
+            return True
+
+    return False
+ans = 0
+for i in range(n):
+    visited=[False]*n
+    if bfs(i):ans+=1
+print(ans)

python/plat3/9525.py

@@ -0,0 +1,55 @@
+import sys
+input = sys.stdin.readline
+
+N = int(input())
+arr = [list(map(str,input().strip())) for _ in range(N)]
+
+right = [[0]*N for _ in range(N)]
+down = [[0]*N for _ in range(N)]
+r,d=1,1
+for x in range(N):
+    flag = False
+    for y in range(N):
+        if arr[y][x]=='.':
+            if flag:
+                d+=1
+                flag=False
+            down[y][x]=d
+        else:
+            flag=True
+    d+=1
+for y in range(N):
+    flag = False
+    for x in range(N):
+        if arr[y][x]=='.':
+            if flag:
+                r+=1
+                flag=False
+            right[y][x]=r
+        else:
+            flag=True
+    r+=1
+adj = [[] for _ in range(r)]
+for y in range(N):
+    for x in range(N):
+        if arr[y][x]=='.':
+            adj[right[y][x]].append(down[y][x])
+N_max = N*N+1
+p = [-1]*(N_max)
+b = [-1]*(N_max)
+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
+            b[idx]=nx
+            return True
+    return False
+
+ans = 0
+for i in range(1,r):
+    if b[i]==-1:
+        visited = [False]*r
+        if dfs(i):ans+=1
+print(ans)