結果
問題 | No.74 貯金箱の退屈 |
ユーザー | ckawatak |
提出日時 | 2018-12-23 12:54:18 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 31 ms / 5,000 ms |
コード長 | 1,309 bytes |
コンパイル時間 | 157 ms |
コンパイル使用メモリ | 11,976 KB |
実行使用メモリ | 10,264 KB |
最終ジャッジ日時 | 2023-10-26 02:29:10 |
合計ジャッジ時間 | 2,380 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
10,224 KB |
testcase_01 | AC | 30 ms
10,224 KB |
testcase_02 | AC | 30 ms
10,224 KB |
testcase_03 | AC | 29 ms
10,240 KB |
testcase_04 | AC | 30 ms
10,232 KB |
testcase_05 | AC | 30 ms
10,236 KB |
testcase_06 | AC | 29 ms
10,236 KB |
testcase_07 | AC | 29 ms
10,240 KB |
testcase_08 | AC | 29 ms
10,236 KB |
testcase_09 | AC | 29 ms
10,232 KB |
testcase_10 | AC | 29 ms
10,232 KB |
testcase_11 | AC | 29 ms
10,232 KB |
testcase_12 | AC | 30 ms
10,232 KB |
testcase_13 | AC | 30 ms
10,244 KB |
testcase_14 | AC | 30 ms
10,264 KB |
testcase_15 | AC | 30 ms
10,228 KB |
testcase_16 | AC | 29 ms
10,228 KB |
testcase_17 | AC | 29 ms
10,224 KB |
testcase_18 | AC | 29 ms
10,224 KB |
testcase_19 | AC | 29 ms
10,232 KB |
testcase_20 | AC | 29 ms
10,228 KB |
testcase_21 | AC | 28 ms
10,228 KB |
testcase_22 | AC | 29 ms
10,224 KB |
testcase_23 | AC | 29 ms
10,224 KB |
testcase_24 | AC | 29 ms
10,228 KB |
testcase_25 | AC | 30 ms
10,228 KB |
testcase_26 | AC | 29 ms
10,228 KB |
testcase_27 | AC | 30 ms
10,228 KB |
testcase_28 | AC | 30 ms
10,228 KB |
testcase_29 | AC | 29 ms
10,228 KB |
testcase_30 | AC | 29 ms
10,228 KB |
testcase_31 | AC | 29 ms
10,228 KB |
testcase_32 | AC | 30 ms
10,228 KB |
ソースコード
N = int(input()) D = list(map(int, input().split(' '))) W = list(map(int, input().split(' '))) def unite(n, graphs, pairs): if n == len(pairs): return graphs pair = pairs[n] united_graph = {} new_graphs = [] for graph in graphs: if pair[0] in graph or pair[1] in graph: united_graph.update(graph) else: new_graphs.append(graph) united_graph.update({pair[0]:1, pair[1]:1}) # flag to indicate that the same coin is flipped if pair[0] == pair[1]: united_graph[N] = 1 new_graphs.append(united_graph) return unite(n+1, new_graphs, pairs) normalized = [] for d in D: normalized.append(d % N) # find coins to be flipped pairs = [] for i,n in enumerate(normalized): pairs.append( ( (i + n + N) % N, (i - n + N) % N ) ) indices = [0 for _ in range(N)] for pair in pairs: indices[pair[0]] = 1 indices[pair[1]] = 1 # find coins not to be flipped and 0 for i in range(N): if indices[i] == 0 and W[i] == 0: print('No') exit(0) graphs = unite(0, [], pairs) for graph in graphs: zeros = 0 for key in graph: if key < N and W[key] == 0: zeros = zeros + 1 if zeros % 2 != 0 and N not in graph: print('No') exit(0) print('Yes')