Submission details
Task:Connect cities
Sender:aalto26bh_002
Submission time:2026-09-06 22:31:04 +0300
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.21 sdetails
#7ACCEPTED0.21 sdetails
#8ACCEPTED0.21 sdetails
#9ACCEPTED0.21 sdetails
#10ACCEPTED0.21 sdetails
#11ACCEPTED0.16 sdetails
#12ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'void dfs(const std::vector<std::vector<int> >&, std::vector<bool>&, std::vector<int>&)':
input/code.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < adj.size(); i++)
      |                     ~~^~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:54:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for (int i = 1; i < connectedComps.size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <vector>
using namespace std;


void dfs_rec(int s, const vector<vector<int>>& adj, vector<bool>& vis)
{
    if (vis[s]) return;
    vis[s] = true;
    for (auto u : adj[s])
    {
        dfs_rec(u, adj, vis);
    }
}

void dfs(const vector<vector<int>>& adj, vector<bool>& vis, vector<int>& connectedComps)
{
    for (int i = 0; i < adj.size(); i++)
    {
        if (vis[i]) continue;
        else
        {
            connectedComps.push_back(i);
            dfs_rec(i, adj, vis);
        }
    }
    return;
}

int main()
{
    int numCities, numRoads;
    cin >> numCities >> numRoads;
    vector<vector<int>> adj(numCities);
    vector<bool> vis(numCities, false);
    vector<int> connectedComps;
    for (int i = 0; i < numRoads; i++)
    {
        int from, to;
        cin >> from >> to;
        from--;
        to--;
        adj[from].push_back(to);
        adj[to].push_back(from);
    }
    dfs(adj, vis, connectedComps);
    if (connectedComps.size() == 0)
    {
        cout << "ERROR" << endl;
    }
    else
    {
        cout << connectedComps.size() - 1 << endl;
        for (int i = 1; i < connectedComps.size(); i++)
        {
            cout << connectedComps[0] + 1 << " " << connectedComps[i] + 1 << endl;
        }
    }
}

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 2
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: ACCEPTED

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

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

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

Test 7

Verdict: ACCEPTED

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

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

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

Test 8

Verdict: ACCEPTED

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

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

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

Test 9

Verdict: ACCEPTED

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

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

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

Test 10

Verdict: ACCEPTED

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

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

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

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
...

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 2
1 7