2021.01.22

Author: seono

cplus/test.cpp

@@ -1,104 +1,15 @@
-#include <bits/stdc++.h>
+#include <iostream>
 using namespace std;
 
-struct Edge{
-	int v, c, dual;
-	Edge(){}
-	Edge(int v, int c, int dual) : v(v), c(c), dual(dual) {}
-};
+int main(void){
+	ios::sync_with_stdio(false);
+	double n1 = 2.555;
+	double n2 = 2.565;
 
-vector<Edge> g[10101];
-int k, n;
-const int s = 1 * 2 + 1;
-const int t = 2 * 2;
+	cout<<fixed;
+  	cout.precision(2);
+  	cout<<n1<<'\n';
+	cout<<n2<<'\n';
 
-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++);
-	}
+	return 0;
 }

python/plat4/1014.py

@@ -0,0 +1,47 @@
+import sys
+input = sys.stdin.readline
+
+T = int(input())
+
+dy,dx = [-1,-1,0],[-1,1,-1]
+def check(y,x):
+    global N, M
+    if arr[y][x]=='x':
+        return False
+    for i in range(3):
+        ny,nx = y+dy[i],x+dx[i]
+        if 0<=ny<N and 0<=nx<M:
+            if arr[ny][nx]=='0':
+                return False
+    return True
+
+def dp(bit,idx):
+    global N, M, limit_bit,ed
+    if idx == ed:return 0
+    if dp_arr[idx][bit]!=-1:
+        return dp_arr[idx][bit]
+    y = idx//M
+    x = idx%M
+    res = 0
+    if check(y,x):
+        arr[y][x]='0'
+        d1 = dp(((bit<<1)|1)&limit_bit,idx+1)+1
+        arr[y][x]='.'
+        d2 = dp((bit<<1)&limit_bit,idx+1)
+        res = max(d1,d2)
+    else:
+        res = dp((bit<<1)&limit_bit,idx+1)
+    dp_arr[idx][bit]=res
+    return res
+
+while T:
+    T-=1
+    N, M = map(int,input().split())
+    ed = N*M
+    #최근 M+1개 비트
+    #현재 idx(Y*M+X)
+    #dp
+    dp_arr = [[-1]*(1<<M+1) for _ in range(N*M+1)]
+    limit_bit = (1<<(M+1))-1
+    arr = [list(input().strip()) for _ in range(N)]
+    print(dp(0,0))

python/plat4/11378.py

@@ -0,0 +1,55 @@
+import sys
+
+input = sys.stdin.readline
+#print = sys.stdout.write
+
+def dfs():
+    ans = 0
+    while True:
+        q = [st]
+        flag=False
+        visited=[-1]*2050
+        while q:
+            n = q.pop()
+
+            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:
+                    flag = True
+                    break
+            if flag:break
+        if visited[ed]==-1:break
+        now = ed
+        while now!=st:
+            fl[visited[now]][now]+=1
+            fl[now][visited[now]]-=1
+            now = visited[now]
+        ans+=1
+    return ans
+
+N, M, K = map(int,input().split())
+adj = [[] for _ in range(2050)]
+cap = [[0]*2050 for _ in range(2050)]
+fl = [[0]*2050 for _ in range(2050)]
+st,ed = 0,2021
+tmp = 2020
+adj[st]=[n for n in range(1,N+1)]+[tmp]
+cap[st][tmp]=K
+for i in range(N+1,N+M+1):
+    cap[i][ed]=1
+    adj[i].append(ed)
+for i in range(1,N+1):
+    row = list(map(int,input().split()))
+    adj[i].append(tmp)
+    adj[tmp].append(i)
+    cap[st][i]=1
+    cap[tmp][i]=K
+    for num in row[1:]:
+        cap[i][num+N]=1
+        adj[i].append(num+N)
+        adj[num+N].append(i)
+        cap[num+N][ed]=1
+print("%d\n"%dfs())

python/plat4/1280.py

@@ -0,0 +1,32 @@
+import sys
+input = sys.stdin.readline
+
+N = int(input())
+
+tree = [0]*(200001)
+cnt = [0]*(200001)
+n = int(input())+1
+tmp = n
+while tmp<=200000:
+    cnt[tmp]+=1
+    tree[tmp]+=n
+    tmp+=(tmp&-tmp)
+ans = 1
+total = n
+for i in range(1,N):
+    n = int(input())+1
+    tmp = n
+    p=q=0
+    while tmp:
+        p+=cnt[tmp]
+        q+=tree[tmp]
+        tmp-=(tmp&-tmp)
+    ans *= p*n-q+total-q-(i-p)*n
+    ans%=1000000007
+    tmp = n
+    while tmp<=200000:
+        cnt[tmp]+=1
+        tree[tmp]+=n
+        tmp+=(tmp&-tmp)
+    total+=n
+print(ans)

python/plat4/14868.py

@@ -0,0 +1,53 @@
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+N, K = map(int,input().split())
+dx,dy = [0,0,1,-1],[-1,1,0,0]
+
+arr = [[0]*N for _ in range(N)]
+u = [[num,1] for num in range(K+1)]
+def find(x):
+    if u[x][0]!=x:
+        u[x][0]=find(u[x][0])
+    return u[x][0]
+
+def Union(x,y):
+    x=find(x)
+    y=find(y)
+    if x!=y:
+        if u[x][1]<u[y][1]:x,y=y,x
+        u[y][0]=x
+        u[x][1]+=u[y][1]
+    return u[x][1]
+def bfs():
+    cnt = 0
+    while True:
+        l = len(st)
+        cnt+=1
+        flag = False
+        while l:
+            l-=1
+            y,x,p = st.popleft()
+            visited[y][x]=1
+            for i in range(4):
+                ny,nx=y+dy[i],x+dx[i]
+                if 0<=ny<N and 0<=nx<N:
+                    if arr[ny][nx]:
+                        if arr[ny][nx]!=p:
+                            if Union(arr[ny][nx],p)==K:
+                                flag=True
+                                if visited[ny][nx]:
+                                    cnt-=1
+                    else:
+                        st.append([ny,nx,p])
+                        arr[ny][nx]=p
+        if flag:return cnt
+
+visited = [[0]*N for _ in range(N)]
+st = deque()
+for num in range(1,K+1):
+    x,y = map(int,input().split())
+    arr[y-1][x-1]=num
+    st.append([y-1,x-1,num])
+print(bfs())

python/plat4/4196.py

@@ -0,0 +1,65 @@
+import sys
+from collections import deque
+input = sys.stdin.readline
+
+T = int(input())
+sys.setrecursionlimit(100000)
+
+def dfs(now):
+    visited[now]=True
+    for nx in adj_f[now]:
+        if visited[nx]:continue
+        dfs(nx)
+    global cur_time
+    finish_time.append(now)
+    return
+def dfs_b(now,idx):
+    visited[now]=True
+    scc[idx].append(now)
+    scc_dict[now]=idx
+    for nx in adj_b[now]:
+        if visited[nx]:continue
+        dfs_b(nx,idx)
+
+
+while T:
+    T-=1
+
+    N, M = map(int,input().split())
+    ans = 0
+    adj_f = [[] for _ in range(N+1)]
+    adj_b = [[] for _ in range(N+1)]
+    finish_time = [0]*(N+1)
+    scc = []
+    cur_time = 0
+    for _ in range(M):
+        x,y = map(int,input().split())
+        adj_f[x].append(y)
+        adj_b[y].append(x)
+    visited = [False]*(N+1)
+    for num in range(1,N+1):
+        if visited[num]:continue
+        dfs(num)
+    visited = [False]*(N+1)
+    i=0
+    scc_dict = [0]*(N+1)
+    for num in finish_time[::-1]:
+        if visited[num]:continue
+        scc.append([])
+        dfs_b(num,i)
+        i+=1
+    indegree = [0]*(len(scc)+1)
+    adj = [[] for _ in range(len(scc)+1)]
+    visited = [False]*(N+1)
+    scc.pop()
+    for idx,sc in enumerate(scc):
+        for num in sc:
+            for nx in adj_f[num]:
+                if nx in sc:continue
+                adj[idx].append(scc_dict[nx])
+                indegree[scc_dict[nx]]+=1
+    q = deque()
+    for num in range(len(scc)):
+        if indegree[num]==0:
+            ans+=1
+    print(ans)