Submission details
Task:Connect cities
Sender:aalto26bh_036
Submission time:2026-09-09 09:01:19 +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.17 sdetails
#12ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In member function 'void compute::assign(int)':
input/code.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for (int j=0;j<data[i].size();j++) {
      |                      ~^~~~~~~~~~~~~~~

Code

#include <iostream>
#include <vector>

using std::cout;
using std::endl;
#define DEBUG std::cout<<"LINE"<<__LINE__
#define IN(A) int A;std::cin>>A;

struct compute {
    std::vector<std::vector<int>> data;
    std::vector<std::pair<int,int>> result;
    std::vector<bool> visited;
    bool start() {

        IN(n);
        IN(m);
        data.assign(n,{});
        visited.assign(n,false);
        for (int i=0;i<m;i++) {
            IN(a);
            IN(b);
            a=a-1;
            b=b-1;
            data[a].emplace_back(b);
            data[b].emplace_back(a);
        }
        assign(0);
        for (int i=0;i<n;i++) {
            if (!visited[i]) {
                result.emplace_back(1,i+1);
                assign(i);
            }
        }
        cout<<result.size()<<endl;
        for (auto res:result) {
          cout<<res.first<<" "<<res.second<<endl;
        }
        return true;
    }
    void assign(int i) {
        if (visited[i]) return;
        visited[i]=true;
        for (int j=0;j<data[i].size();j++) {
            assign(data[i][j]);
        }
    }
};

int main() {
    compute comp;
    comp.start();


}

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