結果
問題 | No.1078 I love Matrix Construction |
ユーザー | Salmonize |
提出日時 | 2020-06-12 23:10:43 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,644 ms / 2,000 ms |
コード長 | 2,713 bytes |
コンパイル時間 | 220 ms |
コンパイル使用メモリ | 11,244 KB |
実行使用メモリ | 156,968 KB |
最終ジャッジ日時 | 2023-09-06 11:16:08 |
合計ジャッジ時間 | 15,684 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
8,032 KB |
testcase_01 | AC | 19 ms
7,972 KB |
testcase_02 | AC | 200 ms
30,076 KB |
testcase_03 | AC | 559 ms
65,148 KB |
testcase_04 | AC | 821 ms
87,140 KB |
testcase_05 | AC | 728 ms
73,496 KB |
testcase_06 | AC | 205 ms
29,472 KB |
testcase_07 | AC | 81 ms
16,336 KB |
testcase_08 | AC | 677 ms
73,596 KB |
testcase_09 | AC | 43 ms
11,796 KB |
testcase_10 | AC | 1,644 ms
156,968 KB |
testcase_11 | AC | 859 ms
91,124 KB |
testcase_12 | AC | 1,356 ms
131,408 KB |
testcase_13 | AC | 1,518 ms
147,356 KB |
testcase_14 | AC | 1,044 ms
103,836 KB |
testcase_15 | AC | 1,440 ms
139,572 KB |
testcase_16 | AC | 71 ms
14,752 KB |
testcase_17 | AC | 17 ms
7,972 KB |
testcase_18 | AC | 151 ms
24,120 KB |
testcase_19 | AC | 358 ms
44,576 KB |
testcase_20 | AC | 350 ms
43,996 KB |
testcase_21 | AC | 26 ms
9,712 KB |
ソースコード
import sys readline = sys.stdin.readline readall = sys.stdin.read ns = lambda: readline().rstrip() ni = lambda: int(readline().rstrip()) nm = lambda: map(int, readline().split()) nl = lambda: list(map(int, readline().split())) prn = lambda x: print(*x, sep='\n') def StronglyConnectedComponents(N, G, RG): group_cnt = 0 used = [0] * N group = [0] * N order = list() for s in range(N): if not used[s]: st = [s] used[s] = 1 while st: v = st[-1] fl = 0 if used[v] <= len(G[v]): if not used[G[v][used[v]-1]]: st.append(G[v][used[v]-1]) used[G[v][used[v]-1]] = 1 used[v] += 1 else: order.append(v) st.pop() used = [0] * N for s in reversed(order): if not used[s]: st = [s] used[s] = 1 while st: v = st[-1] if used[v] <= len(RG[v]): if not used[RG[v][used[v]-1]]: st.append(RG[v][used[v]-1]) used[RG[v][used[v]-1]] = 1 used[v] += 1 else: group[v] = group_cnt st.pop() group_cnt += 1 return group_cnt, group class TwoSatisfilability: def __init__(self, N): self.N = N self.G = [list() for _ in range(N*2)] self.RG = [list() for _ in range(N*2)] self.res = [0] * N def solve(self): _, group = StronglyConnectedComponents(self.N * 2, self.G, self.RG) for i in range(self.N): if group[i] == group[i+self.N]: return False, list() self.res[i] = int(group[i] > group[i+self.N]) return True, self.res def _add_edge(self, a, b): self.G[a].append(b) self.RG[b].append(a) return def add(self, a, apos, b, bpos): ''' a V b ''' self._add_edge(a + self.N * apos, b + self.N * (bpos ^ 1)) self._add_edge(b + self.N * bpos, a + self.N * (apos ^ 1)) return def solve(): n = ni() s = [x-1 for x in nl()] t = [x-1 for x in nl()] u = nl() sat = TwoSatisfilability(n**2) for i in range(n): cs, ct, cu = s[i], t[i], u[i] for j in range(n): x = cs * n + j y = j * n + ct sat.add(x, (cu & 1) ^ 1, y, (cu >> 1) ^ 1) bo, ret = sat.solve() if not bo: print(-1) else: for i in range(n): print(*ret[i*n:(i+1)*n]) return solve()