Submission details
Task:Connect cities
Sender:aalto25a_005
Submission time:2025-09-05 14:15:00 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.04 sdetails
#6--details
#7--details
#8--details
#9--details
#10--details
#11ACCEPTED0.18 sdetails
#12ACCEPTED0.04 sdetails

Code

from time import time
import sys

sys.setrecursionlimit(int(1E5))

t0 = time()
cities, roads = [int(aa) for aa in input().strip().split(" ")]
# alreadyRoads = set([frozenset([int(aa) for aa in input().strip().split(" ")]) for _ in range(roads)])
alreadyRoads = [[int(aa)-1 for aa in input().strip().split(" ")] for _ in range(roads)]

def addSubItems(curItem, listIndex, roadsSetList, roadDict, checkedDict):
    if checkedDict[curItem] != -1:
        # print("Discarded", curItem)
        return 0
    # print("Checking", curItem)
    checkedDict[curItem] = listIndex
    if len(roadsSetList) <= listIndex:
        roadsSetList.append(set())
    
    if curItem in roadDict:
        roadsSetList[checkedDict[curItem]].update(roadDict[curItem])
    else:
        roadsSetList[checkedDict[curItem]] = {curItem}
        return 1
    
    for oneRoad in roadDict[curItem]:
        addSubItems(oneRoad, listIndex, roadsSetList, roadDict, checkedDict)
    return 1

roadDict = {}
for start, end in alreadyRoads:
    if start in roadDict:
        roadDict[start].add(end)
    else:
        roadDict[start] = set([end])
        
    if end in roadDict:
        roadDict[end].add(start)
    else:
        roadDict[end] = set([start])

checkedDict = [-1]*cities
roadsSetList = []
counter = 0
for ii, ids in enumerate(checkedDict):
    counter += addSubItems(ii, counter, roadsSetList, roadDict, checkedDict)
# print(len(roadsSetList))

print(len(roadsSetList)-1)
zeroth = 0
for ii in roadsSetList[0]:
    zeroth = 0
    break

for ii in range(1,len(roadsSetList)):
    cur = 0
    for aa in roadsSetList[ii]:
        cur = aa
        break
    print(zeroth+1, cur+1)

# print(ids)
# addSubItems(curItem=)

# doneList = [False]*counter
# for city in range(1, cities):
#     if roadsDict[city] == -1:
#         roadsDict[city] = counter
#         counter += 1
    

# print(roadsDict)
exit()
t1 = time()
roadGroups = []
# aloneRoads = {cit: True for cit in range(1,cities+1)}
# print(aloneRoads)
for startCity, endCity in alreadyRoads:
    flagged = False
    for group in roadGroups:
        if (startCity in group) and (endCity in group):
            pass
        elif (startCity in group):
            flagged = True
            group.add(endCity)
            # aloneRoads[endCity] = False
        elif (endCity in group):
            flagged = True
            group.add(startCity)
            # aloneRoads[startCity] = False
    if not flagged:
        roadGroups.append(set([startCity,endCity]))
        # aloneRoads[endCity] = False
        # aloneRoads[startCity] = False

for ii in range(cities):
    pass

# roadsLeft = roads*(1+roads)/2 - roads
t2 = time()
print(t1-t0,t2-t1)
# aloneRoadsList = [set([road]) for road in aloneRoads]
# roadGroups += [key for key in aloneRoads if aloneRoads[key]]
# print(aloneRoads)
# print(roadGroups)

Test details

Test 1

Verdict: ACCEPTED

input
10 10
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
2
1 5
1 7

Test 2

Verdict: ACCEPTED

input
10 10
3 9
6 8
9 10
7 8
...

correct output
2
1 4
4 5

user output
2
1 4
1 5

Test 3

Verdict: ACCEPTED

input
10 10
7 9
1 7
1 3
3 4
...

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
10 10
4 8
5 9
4 9
2 7
...

correct output
1
1 3

user output
1
1 3

Test 5

Verdict: ACCEPTED

input
10 10
4 9
2 4
7 10
1 8
...

correct output
0

user output
0

Test 6

Verdict:

input
100000 200000
7233 22146
94937 96203
6133 10731
98737 99193
...

correct output
4785
1 2
2 3
3 4
4 5
...

user output
(empty)

Test 7

Verdict:

input
100000 200000
92950 93575
24401 88897
41796 99364
47106 50330
...

correct output
4868
1 2
2 7
7 9
9 15
...

user output
(empty)

Test 8

Verdict:

input
100000 200000
15637 76736
79169 98809
4382 86557
73383 77029
...

correct output
4683
1 9
9 20
20 27
27 28
...

user output
(empty)

Test 9

Verdict:

input
100000 200000
47932 66981
86401 99942
4353 27841
60492 67345
...

correct output
4807
1 6
6 7
7 11
11 12
...

user output
(empty)

Test 10

Verdict:

input
100000 200000
6554 44548
76413 98555
5447 59589
70166 74434
...

correct output
4786
1 2
2 18
18 21
21 27
...

user output
(empty)

Test 11

Verdict: ACCEPTED

input
100000 1
1 2

correct output
99998
1 3
3 4
4 5
5 6
...

user output
99998
1 3
1 4
1 5
1 6
...
Truncated

Test 12

Verdict: ACCEPTED

input
10 9
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
2
1 5
1 7