結果
問題 | No.2263 Perms |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2023-04-07 23:46:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 158 ms / 2,000 ms |
コード長 | 3,299 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 82,404 KB |
実行使用メモリ | 81,104 KB |
最終ジャッジ日時 | 2024-04-10 18:19:00 |
合計ジャッジ時間 | 5,462 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
56,296 KB |
testcase_01 | AC | 38 ms
54,892 KB |
testcase_02 | AC | 39 ms
54,588 KB |
testcase_03 | AC | 36 ms
55,168 KB |
testcase_04 | AC | 35 ms
54,872 KB |
testcase_05 | AC | 52 ms
66,624 KB |
testcase_06 | AC | 147 ms
79,800 KB |
testcase_07 | AC | 134 ms
79,664 KB |
testcase_08 | AC | 106 ms
78,208 KB |
testcase_09 | AC | 149 ms
81,104 KB |
testcase_10 | AC | 41 ms
61,240 KB |
testcase_11 | AC | 125 ms
78,580 KB |
testcase_12 | AC | 134 ms
79,232 KB |
testcase_13 | AC | 158 ms
80,256 KB |
testcase_14 | AC | 155 ms
80,084 KB |
testcase_15 | AC | 43 ms
61,628 KB |
testcase_16 | AC | 78 ms
76,976 KB |
testcase_17 | AC | 90 ms
77,148 KB |
testcase_18 | AC | 82 ms
77,092 KB |
testcase_19 | AC | 90 ms
77,092 KB |
testcase_20 | AC | 146 ms
80,008 KB |
testcase_21 | AC | 143 ms
79,616 KB |
testcase_22 | AC | 140 ms
79,692 KB |
testcase_23 | AC | 107 ms
77,916 KB |
testcase_24 | AC | 75 ms
77,364 KB |
testcase_25 | AC | 152 ms
79,956 KB |
testcase_26 | AC | 147 ms
79,624 KB |
testcase_27 | AC | 114 ms
78,500 KB |
testcase_28 | AC | 80 ms
76,840 KB |
testcase_29 | AC | 102 ms
77,304 KB |
testcase_30 | AC | 59 ms
71,016 KB |
testcase_31 | AC | 53 ms
66,812 KB |
testcase_32 | AC | 91 ms
77,172 KB |
testcase_33 | AC | 78 ms
77,084 KB |
testcase_34 | AC | 40 ms
57,804 KB |
testcase_35 | AC | 36 ms
54,456 KB |
testcase_36 | AC | 63 ms
72,728 KB |
testcase_37 | AC | 44 ms
62,016 KB |
testcase_38 | AC | 139 ms
79,840 KB |
testcase_39 | AC | 37 ms
56,000 KB |
testcase_40 | AC | 36 ms
54,808 KB |
ソースコード
from collections import deque class MaxFlow: inf = 10**18 class E: def __init__(self,to,cap): self.to = to self.cap = cap self.rev = None def __init__(self,n): self.n = n self.graph = [[] for _ in range(n)] def add_edge(self, fr, to, cap): graph = self.graph edge = self.E(to,cap) edge2 = self.E(fr,0) edge.rev = edge2 edge2.rev = edge graph[fr].append(edge) graph[to].append(edge2) def bfs(self, s, t): level = self.level = [self.n]*self.n q = deque([s]) level[s] = 0 while q: now = q.popleft() lw = level[now]+1 for e in self.graph[now]: if e.cap and level[e.to]> lw: level[e.to] = lw if e.to == t: return True q.append(e.to) return False def dfs(self, s, t, up): graph = self.graph it = self.it level = self.level st = deque([t]) while st: v = st[-1] if v == s: st.pop() flow = up for w in st: e = graph[w][it[w]].rev flow = min(flow, e.cap) for w in st: e = graph[w][it[w]] e.cap += flow e.rev.cap -= flow return flow lv = level[v]-1 while it[v] < len(graph[v]): e = graph[v][it[v]] re = e.rev if re.cap == 0 or lv != level[e.to]: it[v] += 1 continue st.append(e.to) break if it[v] == len(graph[v]): st.pop() level[v] = self.n return 0 def flow(self,s,t,flow_limit=inf): flow = 0 while flow < flow_limit and self.bfs(s,t): self.it = [0]*self.n while flow < flow_limit: f = self.dfs(s,t,flow_limit-flow) if f == 0: break flow += f return flow def min_cut(self,s): visited = [0]*self.n q = deque([s]) while q: v = q.pop() visited[v] = 1 for e in self.graph[v]: if e.cap and not visited[e.to]: q.append(e.to) return visited n,m = map(int,input().split()) A = [list(map(int,input().split())) for i in range(n)] for i in range(n): r = 0 c = 0 for j in range(n): r += A[i][j] c += A[j][i] if r != m or c != m: print(-1) exit() ans = [] for _ in range(m): s = n**2 t = s+1 mf = MaxFlow(t+1) for i in range(n): for j in range(n): if A[i][j]: mf.add_edge(i,n+j,1) for i in range(n): mf.add_edge(s,i,1) mf.add_edge(i+n,t,1) mf.flow(s,t) l = [0]*n for i in range(n): for e in mf.graph[i]: if e.cap: continue to = e.to - n l[i] = to + 1 A[i][to] -= 1 ans.append(l) for i in ans: print(*i)