PAST3E
from 第三回 アルゴリズム実技検定
PAST3E
E グラフに色塗りをする問題。バグを入れないように素朴で簡潔に書く
pythonfrom collections import defaultdict
N, NUM_EDGES, Q = [int(x) for x in input().split()]
edges = defaultdict(list)
for i in range(NUM_EDGES):
v1, v2 = [int(x) for x in input().split()]
edges[v1].append(v2)
edges[v2].append(v1)
colors = [int(x) for x in input().split()]
for i in range(Q):
# print(colors)
f, *v = [int(x) for x in input().split()]
# print(f, v)
if f == 1:
n, = v
c = colors[n - 1]
print(c)
# sprincle
# print(edges)
for v in edges[n]:
colors[v - 1] = c
elif f == 2:
n, c = v
print(colors[n - 1])
colors[n - 1] = cRelated Pages
- →abc168×第三回 アルゴリズム実技検定×abc169×abc173×僕のatcoderの学び方(〜緑)×arc106×僕のatcoderの学び方(〜水色)×abc183×abc187×僕のatcoderの学び方(〜青)→
"Engineer's way of creating knowledge" the English version of my book is now available on [Engineer's way of creating knowledge]
(C)NISHIO Hirokazu / Converted from [Scrapbox] at [Edit]