結果
| 問題 | No.3056 Disconnected Coloring |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2026-07-14 01:41:35 |
| 言語 | PyPy3 (7.3.17) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 1,745 bytes |
| 記録 | |
| コンパイル時間 | 238 ms |
| コンパイル使用メモリ | 96,232 KB |
| 実行使用メモリ | 137,020 KB |
| 最終ジャッジ日時 | 2026-07-14 01:41:54 |
| 合計ジャッジ時間 | 14,126 ms |
|
ジャッジサーバーID (参考情報) |
judge3_1 / judge2_1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 RE * 1 |
| other | AC * 15 WA * 9 RE * 10 |
ソースコード
# https://yukicoder.me/problems/no/3056
from collections import deque
def main():
N, M = map(int, input().split())
edges = []
for _ in range(M):
u, v = map(int, input().split())
edges.append((u - 1, v - 1))
if M % 2 == 1:
print(-1)
return
next_nodes = [[] for _ in range(N)]
for i in range(M):
u, v = edges[i]
next_nodes[u].append((v, i))
next_nodes[v].append((u, i))
for x, _ in next_nodes[0]:
if x == N - 1:
print(-1)
return
answers = [None for _ in range(M)]
queue = deque()
passed = [False] * N
if len(next_nodes[0]) < len(next_nodes[N - 1]):
passed[0] = True
queue.append(0)
f1 = N - 1
else:
passed[N - 1] = True
queue.append(N - 1)
f1 = 0
r_num = M // 2
b_num = M // 2
while len(queue) > 0:
v = queue.popleft()
for w, i in next_nodes[v]:
if answers[i] is None:
if b_num > 0 and w == f1:
b_num -= 1
answers[i] = "B"
else:
r_num -= 1
answers[i] = "R"
if r_num == 0:
break
if w != f1:
if not passed[w]:
passed[w] = True
queue.append(w)
for i in range(N):
if answers[i] is None:
if r_num > 0:
answers[i] = "R"
r_num -= 1
elif b_num > 0:
answers[i] = "B"
b_num -= 1
print("".join(answers))
if __name__ == "__main__":
main()