結果
問題 | No.1477 Lamps on Graph |
ユーザー | terasa |
提出日時 | 2022-06-08 00:21:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 273 ms / 2,000 ms |
コード長 | 2,117 bytes |
コンパイル時間 | 172 ms |
コンパイル使用メモリ | 81,624 KB |
実行使用メモリ | 113,792 KB |
最終ジャッジ日時 | 2023-10-21 03:56:53 |
合計ジャッジ時間 | 9,944 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
55,704 KB |
testcase_01 | AC | 37 ms
55,704 KB |
testcase_02 | AC | 38 ms
55,704 KB |
testcase_03 | AC | 39 ms
55,704 KB |
testcase_04 | AC | 37 ms
55,704 KB |
testcase_05 | AC | 40 ms
55,704 KB |
testcase_06 | AC | 39 ms
55,704 KB |
testcase_07 | AC | 38 ms
55,704 KB |
testcase_08 | AC | 37 ms
55,704 KB |
testcase_09 | AC | 37 ms
55,704 KB |
testcase_10 | AC | 35 ms
55,704 KB |
testcase_11 | AC | 42 ms
55,704 KB |
testcase_12 | AC | 171 ms
87,596 KB |
testcase_13 | AC | 161 ms
87,876 KB |
testcase_14 | AC | 180 ms
89,920 KB |
testcase_15 | AC | 121 ms
80,196 KB |
testcase_16 | AC | 109 ms
82,200 KB |
testcase_17 | AC | 111 ms
81,928 KB |
testcase_18 | AC | 164 ms
96,260 KB |
testcase_19 | AC | 153 ms
90,424 KB |
testcase_20 | AC | 109 ms
78,572 KB |
testcase_21 | AC | 151 ms
97,776 KB |
testcase_22 | AC | 89 ms
77,100 KB |
testcase_23 | AC | 126 ms
80,188 KB |
testcase_24 | AC | 215 ms
92,748 KB |
testcase_25 | AC | 121 ms
80,304 KB |
testcase_26 | AC | 198 ms
98,100 KB |
testcase_27 | AC | 127 ms
81,712 KB |
testcase_28 | AC | 150 ms
85,356 KB |
testcase_29 | AC | 141 ms
82,552 KB |
testcase_30 | AC | 117 ms
89,212 KB |
testcase_31 | AC | 122 ms
83,720 KB |
testcase_32 | AC | 197 ms
113,792 KB |
testcase_33 | AC | 179 ms
108,480 KB |
testcase_34 | AC | 167 ms
106,932 KB |
testcase_35 | AC | 273 ms
102,028 KB |
testcase_36 | AC | 255 ms
103,676 KB |
testcase_37 | AC | 217 ms
97,804 KB |
testcase_38 | AC | 229 ms
98,948 KB |
testcase_39 | AC | 249 ms
103,484 KB |
ソースコード
import sys import pypyjit import itertools import heapq import math from collections import deque, defaultdict import bisect input = sys.stdin.readline sys.setrecursionlimit(10 ** 6) pypyjit.set_param('max_unroll_recursion=-1') def index_lt(a, x): 'return largest index s.t. A[i] < x or -1 if it does not exist' return bisect.bisect_left(a, x) - 1 def index_le(a, x): 'return largest index s.t. A[i] <= x or -1 if it does not exist' return bisect.bisect_right(a, x) - 1 def index_gt(a, x): 'return smallest index s.t. A[i] > x or len(a) if it does not exist' return bisect.bisect_right(a, x) def index_ge(a, x): 'return smallest index s.t. A[i] >= x or len(a) if it does not exist' return bisect.bisect_left(a, x) class TopologicalSort(): def __init__(self, N, E, D): self.N = N self.E = E self.D = D def sort(self): dq = deque([]) for i in range(self.N): if self.D[i] == 0: dq.append(i) if len(dq) == 0: return False, None ret = [] while len(dq) > 0: v = dq.popleft() ret.append(v) for dest in self.E[v]: self.D[dest] -= 1 if self.D[dest] == 0: dq.append(dest) for i in range(self.N): if not self.D[i] == 0: return False, None return True, ret N, M = map(int, input().split()) A = list(map(int, input().split())) E = [[] for _ in range(N)] D = [0] * N for _ in range(M): u, v = map(int, input().split()) u -= 1 v -= 1 if A[u] == A[v]: continue if A[u] > A[v]: u, v = v, u E[u].append(v) D[v] += 1 K = int(input()) B = list(map(lambda x: int(x) - 1, input().split())) lamp = [False] * (N) for b in B: lamp[b] = True success, V = TopologicalSort(N, E, D).sort() assert success is True ans = [] for v in V: if lamp[v] is True: lamp[v] = False ans.append(v + 1) for d in E[v]: lamp[d] = not lamp[d] print(len(ans)) print(*ans, sep='\n')