結果

問題 No.2301 Namorientation
ユーザー mkawa2
提出日時 2023-05-12 22:13:03
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 1,254 ms / 3,000 ms
コード長 2,227 bytes
コンパイル時間 194 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 98,688 KB
最終ジャッジ日時 2024-11-28 18:41:22
合計ジャッジ時間 25,939 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #

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("->")
0