結果
問題 | No.1370 置換門松列 |
ユーザー | chineristAC |
提出日時 | 2021-01-29 21:32:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 208 ms / 2,000 ms |
コード長 | 1,279 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 87,056 KB |
実行使用メモリ | 106,348 KB |
最終ジャッジ日時 | 2023-10-12 21:00:24 |
合計ジャッジ時間 | 6,191 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
71,696 KB |
testcase_01 | AC | 93 ms
71,496 KB |
testcase_02 | AC | 92 ms
71,456 KB |
testcase_03 | AC | 94 ms
71,648 KB |
testcase_04 | AC | 93 ms
71,656 KB |
testcase_05 | AC | 95 ms
71,620 KB |
testcase_06 | AC | 100 ms
71,552 KB |
testcase_07 | AC | 94 ms
71,460 KB |
testcase_08 | AC | 94 ms
71,428 KB |
testcase_09 | AC | 95 ms
71,400 KB |
testcase_10 | AC | 95 ms
71,592 KB |
testcase_11 | AC | 94 ms
71,612 KB |
testcase_12 | AC | 95 ms
71,272 KB |
testcase_13 | AC | 95 ms
71,424 KB |
testcase_14 | AC | 97 ms
71,704 KB |
testcase_15 | AC | 91 ms
71,636 KB |
testcase_16 | AC | 94 ms
71,712 KB |
testcase_17 | AC | 93 ms
71,288 KB |
testcase_18 | AC | 92 ms
71,484 KB |
testcase_19 | AC | 95 ms
71,396 KB |
testcase_20 | AC | 97 ms
71,684 KB |
testcase_21 | AC | 185 ms
104,860 KB |
testcase_22 | AC | 171 ms
104,604 KB |
testcase_23 | AC | 177 ms
106,348 KB |
testcase_24 | AC | 129 ms
95,584 KB |
testcase_25 | AC | 208 ms
104,808 KB |
testcase_26 | AC | 204 ms
104,936 KB |
testcase_27 | AC | 171 ms
106,144 KB |
testcase_28 | AC | 174 ms
105,204 KB |
testcase_29 | AC | 134 ms
91,480 KB |
ソースコード
from collections import deque N,M = map(int,input().split()) a = list(map(int,input().split())) a = [a[i]-1 for i in range(N)] for i in range(N-2): if a[i]==a[i+1] or a[i]==a[i+2] or a[i+1]==a[i+2]: exit(print("No")) edge = [[] for i in range(M)] deg = [0 for i in range(M)] for i in range(N-1): u,v = a[i],a[i+1] if i%2==0: edge[v].append(u) deg[u] += 1 else: edge[u].append(v) deg[v] += 1 deq = deque([v for v in range(M) if deg[v]==0]) X = [-1 for i in range(M)] val = 1 while deq: v = deq.popleft() X[v] = val val += 1 for nv in edge[v]: deg[nv] -= 1 if deg[nv]==0: deq.append(nv) if -1 not in X: print("Yes") print(*X) exit() edge = [[] for i in range(M)] deg = [0 for i in range(M)] for i in range(N-1): u,v = a[i],a[i+1] if i%2==1: edge[v].append(u) deg[u] += 1 else: edge[u].append(v) deg[v] += 1 deq = deque([v for v in range(M) if deg[v]==0]) X = [-1 for i in range(M)] val = 1 while deq: v = deq.popleft() X[v] = val val += 1 for nv in edge[v]: deg[nv] -= 1 if deg[nv]==0: deq.append(nv) if -1 not in X: print("Yes") print(*X) exit() print("No")