#869157 (PyPy3) No.2301 Namorientation

• 問題: No.2301 Namorientation
• ユーザー: FromBooska
• 提出日時: 2023-05-13 10:46:20
• 言語: PyPy3 (7.3.15)
• 結果: WA
• 実行時間: -
• コード長: 3,475 bytes
• コンパイル時間: 165 ms
• コンパイル使用メモリ: 82,048 KB
• 実行使用メモリ: 203,428 KB
• 最終ジャッジ日時: 2024-11-29 04:52:42
• 合計ジャッジ時間: 84,733 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 2
other	AC * 8 WA * 2 TLE * 20

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
# N頂点N辺グラフは1閉路を含むので、閉路になるまでは1方向、そこから1周させればいい
# 次数0の点があれば、そこから閉路まで閉路方向
# 次数0の点がなければ、ただ1周すればいい
# 昨日は実装失敗した、閉路上で方向を付けるときのスタート確定で失敗した
N = int(input())
edge_dic = {}
edge_list = []
edges = [[] for i in range(N+1)]
degree = [0]*(N+1)
for i in range(N):
    a, b = map(int, input().split())
    edge_list.append((a, b))
    edge_dic[(a, b)] = i+1
    edges[a].append(b)
    edges[b].append(a)
    degree[a] += 1
    degree[b] += 1
degone = []
for i in range(1, N+1):
    if degree[i] == 1:
        degone.append(i)
# まず閉路を確定させる
from collections import deque
que = deque()
for v in degone:
    que.append((v, 0))
    degree[v] -= 1
while que:
    current, prev = que.popleft()
    #print('current', current, 'prev', prev, degree)
    for nxt in edges[current]:
        if nxt != prev:
            degree[nxt] -= 1
            if degree[nxt] == 1:
                que.append((nxt, current))
#print(degree)
circuit = []
for i in range(1, N+1):
    if degree[i] >= 2:
        circuit.append(i)
#print(circuit)
circuit_set = set(circuit)
que2 = deque()
for v in degone:
    for i in range(N):
        a, b = edge_list[i]
        if a == v:
            last = a
            start = b
            que2.append((start, last))
            break
        elif b == v:
            last = b
            start = a
            que2.append((start, last))
            break
#print('que2', que2)    
ans_list = [0]*(N+1)
while que2:
    current, prev = que2.popleft()
    #print('current', current, 'prev', prev)
    if (current, prev) in edge_dic:
        if ans_list[edge_dic[(current, prev)]] == 0:
            ans_list[edge_dic[(current, prev)]] = -1
        else:
            pass
    elif (prev, current) in edge_dic:
        if ans_list[edge_dic[(prev, current)]] == 0:
            ans_list[edge_dic[(prev, current)]] = +1
        else:
            pass
        
    if current not in circuit:
        for nxt in edges[current]:
            if nxt != prev:
                que2.append((nxt, current))
# 今度は閉路の辺に方向を付ける
que3 = deque()
for i in range(N):
    a, b = edge_list[i]
    # ここでWAした、a, b両方とも閉路上が必要
    if a in circuit_set and b in circuit_set:
        if a == circuit[0]:
            last = a
            start = b
            que3.append((start, last))
            break
        elif b == circuit[0]:
            last = b
            start = a
            que3.append((start, last))
            break
#print(que3)
        
while que3:
    current, prev = que3.popleft()
    #print('current', current, 'prev', prev)
    if (current, prev) in edge_dic:
        if ans_list[edge_dic[(current, prev)]] == 0:
            ans_list[edge_dic[(current, prev)]] = -1
        else:
            break
    elif (prev, current) in edge_dic:
        if ans_list[edge_dic[(prev, current)]] == 0:
            ans_list[edge_dic[(prev, current)]] = +1
        else:
            break
        
    for nxt in edges[current]:
        if nxt != prev and nxt in circuit:
            que3.append((nxt, current))      
#print(ans_list)
for i in range(1, N+1):
    if ans_list[i] == 1:
        print('->')
    elif ans_list[i] == -1:
        print('<-')
    else:
        print('not determined')
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX