結果
問題 | No.2301 Namorientation |
ユーザー | mkawa2 |
提出日時 | 2023-05-12 22:13:03 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,168 ms / 3,000 ms |
コード長 | 2,227 bytes |
コンパイル時間 | 730 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 98,944 KB |
最終ジャッジ日時 | 2024-05-06 12:16:14 |
合計ジャッジ時間 | 26,071 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
10,880 KB |
testcase_01 | AC | 27 ms
10,880 KB |
testcase_02 | AC | 27 ms
10,752 KB |
testcase_03 | AC | 29 ms
10,880 KB |
testcase_04 | AC | 27 ms
10,752 KB |
testcase_05 | AC | 26 ms
11,008 KB |
testcase_06 | AC | 27 ms
10,880 KB |
testcase_07 | AC | 27 ms
10,880 KB |
testcase_08 | AC | 27 ms
10,880 KB |
testcase_09 | AC | 26 ms
11,008 KB |
testcase_10 | AC | 28 ms
11,008 KB |
testcase_11 | AC | 29 ms
10,880 KB |
testcase_12 | AC | 677 ms
43,136 KB |
testcase_13 | AC | 582 ms
40,192 KB |
testcase_14 | AC | 1,078 ms
64,756 KB |
testcase_15 | AC | 720 ms
46,976 KB |
testcase_16 | AC | 988 ms
57,216 KB |
testcase_17 | AC | 703 ms
44,720 KB |
testcase_18 | AC | 961 ms
57,984 KB |
testcase_19 | AC | 526 ms
38,528 KB |
testcase_20 | AC | 1,007 ms
58,488 KB |
testcase_21 | AC | 697 ms
46,336 KB |
testcase_22 | AC | 1,025 ms
98,944 KB |
testcase_23 | AC | 986 ms
97,536 KB |
testcase_24 | AC | 825 ms
83,072 KB |
testcase_25 | AC | 594 ms
49,776 KB |
testcase_26 | AC | 747 ms
61,328 KB |
testcase_27 | AC | 1,117 ms
65,204 KB |
testcase_28 | AC | 1,167 ms
65,536 KB |
testcase_29 | AC | 1,155 ms
65,324 KB |
testcase_30 | AC | 1,168 ms
65,208 KB |
testcase_31 | AC | 1,129 ms
64,896 KB |
ソースコード
import sys sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) 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 << 63)-1 # md = 10**9+7 md = 998244353 n = II() to = [[] for _ in range(n)] uv = [] for _ in range(n): u, v = LI1() to[u].append(v) to[v].append(u) uv.append((u, v)) isloop = [0]*n loops = [] vis = [0]*n def loop(u=0, p=-1): vis[u] = 1 for v in to[u]: if v == p: continue if vis[v] == 0: s = loop(v, u) if s != -1: loops.append(u) isloop[u] = 1 vis[u] = 2 if s == u: return -1 return s elif vis[v] == 1: loops.append(u) isloop[u] = 1 vis[u] = 2 return v vis[u] = 2 return -1 loop() # print(loops) # print(isloop) def dfs(root=0): uu, stack = [], [root] while stack: u = stack.pop() uu.append(u) for v in to[u]: if v == parent[u]: continue if isloop[v]: continue parent[v] = u depth[v] = depth[u]+1 stack.append(v) return uu parent, depth = [-1]*n, [0]*n for u in range(n): if isloop[u]: dfs(u) pos = {u: p for p, u in enumerate(loops)} for u, v in uv: if isloop[u] and isloop[v]: if (pos[u]+1)%len(loops) == pos[v]: print("<-") else: print("->") elif isloop[u] and isloop[v] == 0: print("<-") elif isloop[u] == 0 and isloop[v]: print("->") else: if depth[u] < depth[v]: print("<-") else: print("->")