Submission #1018502


Source Code Expand

n, k, l = map(int, raw_input().split())

def root(x):
    if x != parent[x]: x = parent[x] = root(parent[x])
    return x
def unite(x, y):
    px = root(x)
    py = root(y)
    if px < py:
        parent[py] = px
    else:
        parent[px] = py

parent = range(n)
for i in xrange(k):
    p, q = map(int, raw_input().split())
    unite(p-1, q-1)
parent1 = parent
for i in xrange(n):root(i)

parent = range(n)
for j in xrange(l):
    r, s = map(int, raw_input().split())
    unite(r-1, s-1)
parent2 = parent
for i in xrange(n):root(i)

dic = {}
for p1, p2 in zip(parent1, parent2):
    dic[p1, p2] = dic.get((p1, p2), 0) + 1

ans = [dic[p1, p2] for p1, p2 in zip(parent1, parent2)]
print " ".join(map(str, ans))

Submission Info

Submission Time
Task D - Connectivity
User yaketake08
Language Python (2.7.6)
Score 0
Code Size 745 Byte
Status WA
Exec Time 1353 ms
Memory 60728 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 3
WA × 15
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 16 ms 2696 KB
subtask0_1.txt AC 16 ms 2696 KB
subtask0_2.txt AC 16 ms 2696 KB
subtask1_0.txt WA 846 ms 3204 KB
subtask1_1.txt WA 1278 ms 60728 KB
subtask1_10.txt WA 871 ms 3332 KB
subtask1_11.txt WA 1211 ms 45956 KB
subtask1_12.txt WA 1152 ms 44604 KB
subtask1_13.txt WA 1299 ms 48212 KB
subtask1_14.txt WA 1142 ms 40956 KB
subtask1_2.txt WA 1027 ms 36796 KB
subtask1_3.txt WA 1298 ms 47948 KB
subtask1_4.txt WA 1156 ms 42816 KB
subtask1_5.txt WA 943 ms 3332 KB
subtask1_6.txt WA 1162 ms 43732 KB
subtask1_7.txt WA 1177 ms 48208 KB
subtask1_8.txt WA 1353 ms 48560 KB
subtask1_9.txt WA 1101 ms 35516 KB