2021.01.12

Author: seono

cplus/test.cpp

@@ -0,0 +1,104 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct Edge{
+	int v, c, dual;
+	Edge(){}
+	Edge(int v, int c, int dual) : v(v), c(c), dual(dual) {}
+};
+
+vector<Edge> g[10101];
+int k, n;
+const int s = 1 * 2 + 1;
+const int t = 2 * 2;
+
+void addEdge(int s, int e, int x){
+	g[s].emplace_back(e, 1, g[e].size());
+	g[e].emplace_back(s, 0, g[s].size()-1);
+}
+
+void init(){
+	for(int i=0; i<10101; i++) g[i].clear();
+}
+
+bool flow(){
+	int path[10101] = {0};
+	int par[10101]; memset(par, -1, sizeof par);
+	queue<int> q; q.push(s);
+	while(q.size()){
+		int now = q.front(); q.pop();
+		for(int x=0; x<g[now].size(); x++){
+			auto i = g[now][x];
+			int nxt = i.v;
+			int cap = i.c;
+			int dual = i.dual;
+			if(par[nxt] == -1 && cap > 0){
+				par[nxt] = now;
+				path[nxt] = x;
+				q.push(nxt);
+			}
+		}
+	}
+	if(par[t] == -1) return 0;
+
+	for(int i=t; i!=s; i=par[i]){
+		int a = par[i], b = i;
+		g[a][path[b]].c --;
+		int dual = g[a][path[b]].dual;
+		g[b][dual].c ++;
+	}
+	return 1;
+}
+
+void print(){
+	int prv = -2, now = s;
+	while(now/2 != 2){
+		if(now & 1) printf("%d ", now/2);
+		prv = now;
+		if(now % 2 == 0){
+			now = now + 1; continue;
+		}
+		for(int i=0; i<g[now].size(); i++){
+			int nxt = g[now][i].v;
+			if(nxt/2 == now/2) continue;
+			if(g[now][i].c == 0){
+				g[now][i].c = 1;
+				now = nxt;
+				break;
+			}
+		}
+	}
+	printf("%d\n", 2);
+}
+
+void solve(int tc){
+	init();
+	for(int i=1; i<=n; i++){
+		addEdge(i*2, i*2+1, 1);
+		int j; char c;
+		while(1){
+			scanf("%d%c", &j, &c);
+			addEdge(i*2+1, j*2, 1);
+			if(c == '\n') break;
+		}
+	}
+
+	printf("Case %d:\n", tc);
+	for(int i=0; i<k; i++){
+		if(!flow()){
+			printf("Impossible\n\n"); return;
+		}
+	}
+
+	for(int i=0; i<k; i++) print();
+	printf("\n");
+}
+
+int main(){
+	int asdf = 1;
+	while(1){
+		scanf("%d %d", &k, &n);
+		if(!k && !n) break;
+		solve(asdf++);
+	}
+}

python/plat2/7616.py

@@ -0,0 +1,57 @@
+import sys
+from collections import deque
+input = sys.stdin.readline
+print = sys.stdout.write
+
+def dfs():
+    #global st,ed,adj,cap,fl,N,K,T
+    ans = []
+    chk =  [0]*(N+1)
+    while True:
+        visited = [-1]*(N+1)
+        q = deque([st])
+        while q:
+            n = q.popleft()
+            for nx in adj[n]:
+                if chk[nx]==0 and visited[nx]==-1 and cap[n][nx] > fl[n][nx]:
+                    q.append(nx)
+                    visited[nx]=n
+                    if nx==ed:break
+        if visited[ed]==-1:break
+        
+        now = ed
+        tmp = [ed]
+        while now!=st:
+            chk[now]=1
+            fl[visited[now]][now]+=1
+            fl[now][visited[now]]-=1
+            now = visited[now]
+            tmp.append(now)
+        ans.append(tmp)
+        chk[ed]=0
+    print("Case %d:\n"%T)
+    if len(ans)>=K:
+        for row in ans[:K]:
+            print(" ".join(map(str,row[::-1])))
+            print("\n")
+        print("\n")
+    else:
+        print("Impossible\n\n")
+
+
+st,ed = 1,2
+T = 0
+while True:
+    T+=1
+    K, N = map(int,input().split())
+    if K==0 and N==0:break
+    cap = [[0]*(N+1) for _ in range(N+1)]
+    fl = [[0]*(N+1) for _ in range(N+1)]
+    adj = [[] for _ in range(N+1)]
+    for i in range(1,N+1):
+        row = list(map(int,input().split()))
+        for r in row:
+            cap[i][r]=1
+            cap[r][i]=1
+        adj[i]=row[::-1]
+    dfs()

python/plat4/2188.py

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

python/plat4/6086.py

@@ -0,0 +1,56 @@
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+N = int(input())
+cap = [[0]*52 for _ in range(52)]
+fl = [[0]*52 for _ in range(52)]
+adj = [[] for _ in range(52)]
+for _ in range(N):
+    a,b,c=input().strip().split()
+    a = ord(a)-ord('A')
+    b = ord(b)-ord('A')
+    if a>25:
+        a = a-6
+    if b>25:
+        b = b-6
+    c=int(c)
+    cap[a][b]+=c
+    cap[b][a]+=c
+    adj[a].append(b)
+    adj[b].append(a)
+
+def bfs(st,ed):
+    ans = 0
+    while True:
+        visited = [-1]*52
+
+        q = deque([st])
+
+        while q:
+            n = q.popleft()
+
+            for nx in adj[n]:
+                if cap[n][nx]-fl[n][nx]<=0:continue
+                if visited[nx]!=-1:continue
+
+                q.append(nx)
+                visited[nx]=n
+                if nx==ed:break
+        if visited[ed]==-1:break
+
+        flow = sys.maxsize
+        now = ed
+        while now!=st:
+            flow = min(flow, cap[visited[now]][now] - fl[visited[now]][now])
+            now = visited[now]
+        now = ed
+        while now!=st:
+            fl[visited[now]][now]+=flow
+            fl[now][visited[now]]-=flow
+            now = visited[now]
+        ans+=flow
+    return ans
+
+
+print(bfs(0,25))

python/plat5/1135.py

@@ -0,0 +1,19 @@
+import sys
+input = sys.stdin.readline
+
+N = int(input())
+arr = list(map(int,input().split()))
+adj = [[] for _ in range(N)]
+for idx,num in enumerate(arr[1:],1):
+    adj[num].append(idx)
+
+def dfs(idx):
+    ret = 0
+    tmp = []
+    for num in adj[idx]:
+        tmp.append(dfs(num))
+    for time,num in enumerate(sorted(tmp,reverse=True),1):
+        ret = max(ret,num+time)
+    return ret
+
+print(dfs(0))