結果
問題 | No.1813 Magical Stones |
ユーザー | first_vil |
提出日時 | 2022-01-15 15:01:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 490 ms / 2,000 ms |
コード長 | 1,405 bytes |
コンパイル時間 | 358 ms |
コンパイル使用メモリ | 87,004 KB |
実行使用メモリ | 114,392 KB |
最終ジャッジ日時 | 2023-08-13 21:58:50 |
合計ジャッジ時間 | 14,365 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
71,412 KB |
testcase_01 | AC | 67 ms
71,392 KB |
testcase_02 | AC | 68 ms
71,228 KB |
testcase_03 | AC | 97 ms
87,848 KB |
testcase_04 | AC | 68 ms
71,264 KB |
testcase_05 | AC | 69 ms
71,332 KB |
testcase_06 | AC | 116 ms
78,592 KB |
testcase_07 | AC | 71 ms
71,288 KB |
testcase_08 | AC | 82 ms
76,468 KB |
testcase_09 | AC | 86 ms
76,368 KB |
testcase_10 | AC | 79 ms
76,164 KB |
testcase_11 | AC | 159 ms
83,856 KB |
testcase_12 | AC | 69 ms
71,592 KB |
testcase_13 | AC | 69 ms
71,624 KB |
testcase_14 | AC | 95 ms
87,896 KB |
testcase_15 | AC | 444 ms
109,804 KB |
testcase_16 | AC | 436 ms
109,368 KB |
testcase_17 | AC | 434 ms
114,392 KB |
testcase_18 | AC | 436 ms
109,936 KB |
testcase_19 | AC | 420 ms
110,348 KB |
testcase_20 | AC | 394 ms
109,640 KB |
testcase_21 | AC | 406 ms
109,540 KB |
testcase_22 | AC | 415 ms
109,168 KB |
testcase_23 | AC | 393 ms
109,164 KB |
testcase_24 | AC | 103 ms
77,628 KB |
testcase_25 | AC | 134 ms
81,132 KB |
testcase_26 | AC | 122 ms
78,772 KB |
testcase_27 | AC | 296 ms
99,024 KB |
testcase_28 | AC | 490 ms
103,600 KB |
testcase_29 | AC | 337 ms
103,192 KB |
testcase_30 | AC | 395 ms
101,528 KB |
testcase_31 | AC | 396 ms
109,436 KB |
testcase_32 | AC | 67 ms
71,604 KB |
testcase_33 | AC | 67 ms
71,500 KB |
testcase_34 | AC | 119 ms
78,560 KB |
testcase_35 | AC | 129 ms
80,204 KB |
testcase_36 | AC | 109 ms
78,528 KB |
testcase_37 | AC | 157 ms
84,452 KB |
testcase_38 | AC | 135 ms
88,972 KB |
testcase_39 | AC | 288 ms
99,032 KB |
testcase_40 | AC | 116 ms
78,248 KB |
testcase_41 | AC | 103 ms
78,040 KB |
testcase_42 | AC | 127 ms
80,528 KB |
testcase_43 | AC | 131 ms
79,344 KB |
ソースコード
import sys int1 = lambda x: int(x) - 1 # input = lambda: sys.stdin.buffer.readline() input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) i1 = lambda: int1(input()) mi = lambda: map(int, input().split()) mi1 = lambda: map(int1, input().split()) li = lambda: list(mi()) li1 = lambda: list(mi1()) lli = lambda n: [li() for _ in range(n)] INF = float("inf") mod = int(1e9 + 7) # mod = 998244353 n, m = mi() g = [list() for i in range(n)] rg = [list() for i in range(n)] for i in range(m): a, b = mi1() g[a].append(b) rg[b].append(a) st = [] order = [] used = [False] * n for i in range(n): st.append(i) while st: cur = st.pop() if cur < 0: order.append(-cur - 1) continue if used[cur]: continue used[cur] = True st.append(-cur - 1) for to in g[cur]: st.append(to) cmp = [-1] * n c = 0 for v in order[::-1]: if cmp[v] != -1: continue st.append(v) while st: cur = st.pop() if cmp[cur] != -1: continue cmp[cur] = c for to in rg[cur]: st.append(to) c += 1 IN = [0] * c OUT = [0] * c for cur in range(n): for to in g[cur]: if cmp[to] != cmp[cur]: OUT[cmp[cur]] += 1 IN[cmp[to]] += 1 if c == 1: print(0) else: print(max(IN.count(0), OUT.count(0)))