結果
問題 | No.2464 To DAG |
ユーザー | mkawa2 |
提出日時 | 2023-09-08 23:03:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 876 ms / 2,000 ms |
コード長 | 1,628 bytes |
コンパイル時間 | 1,917 ms |
コンパイル使用メモリ | 86,856 KB |
実行使用メモリ | 200,432 KB |
最終ジャッジ日時 | 2023-09-08 23:04:38 |
合計ジャッジ時間 | 31,846 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,520 KB |
testcase_01 | AC | 75 ms
71,496 KB |
testcase_02 | AC | 725 ms
200,432 KB |
testcase_03 | AC | 846 ms
146,660 KB |
testcase_04 | AC | 799 ms
142,476 KB |
testcase_05 | AC | 828 ms
141,228 KB |
testcase_06 | AC | 804 ms
141,140 KB |
testcase_07 | AC | 653 ms
121,504 KB |
testcase_08 | AC | 737 ms
129,244 KB |
testcase_09 | AC | 756 ms
126,368 KB |
testcase_10 | AC | 695 ms
126,660 KB |
testcase_11 | AC | 537 ms
110,748 KB |
testcase_12 | AC | 437 ms
102,860 KB |
testcase_13 | AC | 526 ms
111,876 KB |
testcase_14 | AC | 620 ms
119,580 KB |
testcase_15 | AC | 718 ms
137,408 KB |
testcase_16 | AC | 444 ms
109,240 KB |
testcase_17 | AC | 152 ms
81,956 KB |
testcase_18 | AC | 283 ms
95,716 KB |
testcase_19 | AC | 72 ms
71,356 KB |
testcase_20 | AC | 72 ms
71,128 KB |
testcase_21 | AC | 73 ms
71,128 KB |
testcase_22 | AC | 487 ms
130,652 KB |
testcase_23 | AC | 487 ms
129,460 KB |
testcase_24 | AC | 477 ms
131,084 KB |
testcase_25 | AC | 466 ms
130,984 KB |
testcase_26 | AC | 247 ms
89,780 KB |
testcase_27 | AC | 851 ms
147,700 KB |
testcase_28 | AC | 876 ms
147,692 KB |
testcase_29 | AC | 869 ms
145,716 KB |
testcase_30 | AC | 721 ms
131,268 KB |
testcase_31 | AC | 670 ms
127,236 KB |
testcase_32 | AC | 645 ms
126,532 KB |
testcase_33 | AC | 735 ms
142,104 KB |
testcase_34 | AC | 430 ms
108,864 KB |
testcase_35 | AC | 425 ms
135,704 KB |
testcase_36 | AC | 414 ms
135,632 KB |
testcase_37 | AC | 398 ms
135,852 KB |
testcase_38 | AC | 384 ms
135,828 KB |
testcase_39 | AC | 84 ms
80,500 KB |
testcase_40 | AC | 84 ms
80,364 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(1000005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() 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)] inf = -1-(-1 << 63) # md = 10**9+7 md = 998244353 def dfs(u): uu, ii = [u], [] vis[u] = 1 while uu: u = uu[-1] v = i = -1 while to[u] and use[i]: v, i = to[u].pop() if use[i]: vis[u] = 0 uu.pop() if ii:ii.pop() elif vis[v]: dead[i] = 1 use[i] = 1 while uu[-1] != v: u = uu.pop() vis[u] = 0 i = ii.pop() dead[i] = 1 else: uu.append(v) ii.append(i) use[i] = 1 vis[v] = 1 n, m = LI() to = [[] for _ in range(n)] uv = [] for i in range(m): u, v = LI1() to[u].append((v, i)) uv.append((u+1, v+1)) dead = [0]*m use = [0]*m+[1] vis = [0]*n for u in range(n): if not to[u]: continue dfs(u) print(n, m-sum(dead)) for i in range(m): if dead[i]: continue print(*uv[i])