結果
問題 | No.1477 Lamps on Graph |
ユーザー | mkawa2 |
提出日時 | 2021-04-16 21:21:29 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 489 ms / 2,000 ms |
コード長 | 1,390 bytes |
コンパイル時間 | 186 ms |
コンパイル使用メモリ | 11,000 KB |
実行使用メモリ | 38,064 KB |
最終ジャッジ日時 | 2023-09-15 23:22:44 |
合計ジャッジ時間 | 10,399 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 17 ms
8,212 KB |
testcase_01 | AC | 17 ms
8,052 KB |
testcase_02 | AC | 16 ms
8,180 KB |
testcase_03 | AC | 16 ms
8,104 KB |
testcase_04 | AC | 16 ms
8,032 KB |
testcase_05 | AC | 16 ms
8,040 KB |
testcase_06 | AC | 16 ms
8,092 KB |
testcase_07 | AC | 16 ms
8,116 KB |
testcase_08 | AC | 16 ms
8,048 KB |
testcase_09 | AC | 16 ms
8,032 KB |
testcase_10 | AC | 16 ms
8,164 KB |
testcase_11 | AC | 16 ms
8,056 KB |
testcase_12 | AC | 291 ms
20,752 KB |
testcase_13 | AC | 247 ms
23,392 KB |
testcase_14 | AC | 327 ms
23,456 KB |
testcase_15 | AC | 153 ms
13,720 KB |
testcase_16 | AC | 90 ms
15,484 KB |
testcase_17 | AC | 85 ms
15,196 KB |
testcase_18 | AC | 228 ms
31,728 KB |
testcase_19 | AC | 211 ms
23,560 KB |
testcase_20 | AC | 103 ms
12,636 KB |
testcase_21 | AC | 191 ms
28,512 KB |
testcase_22 | AC | 84 ms
10,236 KB |
testcase_23 | AC | 204 ms
14,856 KB |
testcase_24 | AC | 362 ms
28,008 KB |
testcase_25 | AC | 137 ms
13,612 KB |
testcase_26 | AC | 316 ms
30,076 KB |
testcase_27 | AC | 173 ms
15,300 KB |
testcase_28 | AC | 202 ms
19,240 KB |
testcase_29 | AC | 208 ms
18,232 KB |
testcase_30 | AC | 112 ms
21,868 KB |
testcase_31 | AC | 94 ms
17,608 KB |
testcase_32 | AC | 399 ms
38,064 KB |
testcase_33 | AC | 381 ms
35,964 KB |
testcase_34 | AC | 356 ms
35,812 KB |
testcase_35 | AC | 489 ms
35,796 KB |
testcase_36 | AC | 451 ms
35,444 KB |
testcase_37 | AC | 410 ms
31,120 KB |
testcase_38 | AC | 438 ms
32,704 KB |
testcase_39 | AC | 450 ms
35,796 KB |
ソースコード
import sys # sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def FI(): return float(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] dij = [(0, 1), (1, 0), (1, 1), (1, -1)] inf = 10**16 md = 998244353 # md = 10**9+7 n, m = LI() aa = LI() to = [[] for _ in range(n)] for _ in range(m): u, v = LI1() if aa[u] == aa[v]: continue if aa[u] > aa[v]: u, v = v, u to[u].append(v) topo = [] fin = [False]*n def dfs(u): fin[u] = True for v in to[u]: if fin[v]: continue dfs(v) topo.append(u) for u in range(n): if fin[u]: continue dfs(u) k = II() bb = LI1() dp = [False]*n for b in bb: dp[b] = True ans = [] for u in topo[::-1]: if dp[u]: ans.append(u+1) for v in to[u]: dp[v] = not dp[v] print(len(ans)) print(*ans, sep="\n")