Submission details
Task:Connect cities
Sender:hundlij1
Submission time:2025-09-06 17:11:18 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.17 sdetails
#70.17 sdetails
#80.18 sdetails
#90.18 sdetails
#100.18 sdetails
#110.01 sdetails
#120.00 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i = 0; i < addNodes.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> adj(n+1);
    vector<int> addNodes;

    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    while(true) {
        queue<int> q;
    bool visited[n];
    int distance[n];

    visited[1] = true;
    distance[1] = 0;
    q.push(1);
    while (!q.empty()) {
        int s = q.front(); q.pop();
        // process node s
        for (auto u : adj[s]) {
            if (visited[u]) continue;
            visited[u] = true;
            distance[u] = distance[s]+1;
            q.push(u);
        }
    }

    for(int i = 1; i <= n; i++) {
        if(!visited[i]) {
            adj[1].push_back(i);
            adj[i].push_back(1);
            addNodes.push_back(i);
            break;
        }
    }

    for(int i = 0; i < addNodes.size(); i++) {
       cout << addNodes[i] << " " << 1 << endl;
    }
    return 0;


}
}

Test details

Test 1

Verdict:

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

correct output
2
1 2
2 7

user output
6 1

Test 2

Verdict:

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

correct output
2
1 4
4 5

user output
6 1

Test 3

Verdict:

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

correct output
0

user output
6 1

Test 4

Verdict:

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

correct output
1
1 3

user output
6 1

Test 5

Verdict:

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

correct output
0

user output
6 1

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

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

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

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

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

Test 11

Verdict:

input
100000 1
1 2

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

user output
3 1

Test 12

Verdict:

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

correct output
2
1 2
2 7

user output
6 1