Submission details
Task:Connect cities
Sender:Olivernator
Submission time:2025-09-07 19:31:23 +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.10 sdetails
#70.10 sdetails
#80.10 sdetails
#90.10 sdetails
#100.10 sdetails
#110.02 sdetails
#120.00 sdetails

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
input/code.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         scanf("%d %d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Code

#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

int main(int argc, char *argv[]) {
    int n,m;
    scanf("%d %d",&n,&m);

    vector<vector<int>> adj(n,vector<int>());
    unordered_set<int> unvisited;

    for (int i = 0; i < n; i++) {
        unvisited.insert(i);
    }

    for (int i = 0; i < m; i++) {
        int a,b;
        scanf("%d %d", &a, &b);
        adj[a-1].push_back(b-1);
        adj[b-1].push_back(a-1);
    }

    vector<pair<int, int>> storage(0);
    queue<int> q;
    int last_unvisited = 0;
    do{
        q.push(last_unvisited);
        while (!q.empty()) {
            int current = q.front();
            for (const int &i : adj[current]) {
                if(unvisited.find(i) != unvisited.end()){
                    q.push(i);
                }
            } 
            unvisited.erase(unvisited.find(current));
            q.pop();
        }

        if (unvisited.size() > 0){
            int to = *unvisited.begin();
            unvisited.erase(unvisited.begin());
            adj[0].push_back(to);
            storage.push_back(pair(to, 0));
            last_unvisited = to;
        } 

    } while(unvisited.size() > 0);

    printf("%d\n", (int)storage.size());
    for (pair<int, int>& i : storage) {
        printf("%d %d\n", i.first + 1, i.second +1 );
    }

    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
(empty)

Test 2

Verdict:

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

correct output
2
1 4
4 5

user output
(empty)

Test 3

Verdict:

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

correct output
0

user output
(empty)

Test 4

Verdict:

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

correct output
1
1 3

user output
(empty)

Test 5

Verdict:

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

correct output
0

user output
(empty)

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:

input
100000 1
1 2

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

user output
(empty)

Test 12

Verdict:

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

correct output
2
1 2
2 7

user output
(empty)