CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Connect cities
Sender:arnxxau
Submission time:2024-09-11 00:31:32 +0300
Language:C++11
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#3ACCEPTED0.00 sdetails
#40.00 sdetails
#5ACCEPTED0.00 sdetails
#60.20 sdetails
#70.19 sdetails
#80.20 sdetails
#90.19 sdetails
#100.20 sdetails
#110.01 sdetails
#120.00 sdetails

Compiler report

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

Code

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main() {
    int c, r;
    cin >> c >> r;

    //vector<vector<bool> > roads(c, vector<bool>(c, false));
    vector<bool> visited(c, false);

    vector< vector<int > > roads(c);

        cout << "x0" << endl;


    for (int i = 0; i < r; i++) {
        int city1, city2;
        cin >> city1 >> city2;

        --city1; --city2;

        roads[city1].push_back(city2);
        roads[city2].push_back(city1);
    }

    vector<int> news;
    for (int i = 0; i < c; ++i) {

        int start = i;
        int end = -1;
        
        queue<int> q;
        q.push(start);

        while(not q.empty()) {
            int current = q.front();
            q.pop();

            for (int node : roads[current]) {
                if (!visited[node]) {
                    end = current;
                    q.push(node);
                    visited[node] = true;
                }
            }
        }
        if (end != -1) news.push_back(end);

        


    }

    cout << news.size()/2 << endl;

    for (int i = 1; i < news.size(); ++i) cout << news[i - 1] + 1<< ' ' << news[i] + 1 << endl;

}

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
x0
1
4 8

Test 2

Verdict:

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

correct output
2
1 4
4 5

user output
x0
0

Test 3

Verdict: ACCEPTED

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

correct output
0

user output
x0
0

Test 4

Verdict:

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

correct output
1
1 3

user output
x0
0

Test 5

Verdict: ACCEPTED

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

correct output
0

user output
x0
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
x0
147
11905 43407
43407 65613
65613 47860
...

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
x0
136
18327 37003
37003 3909
3909 20854
...

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
x0
141
2576 2536
2536 3964
3964 62937
...

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
x0
141
36171 6305
6305 34796
34796 17676
...

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
x0
117
9166 20770
20770 9042
9042 33048
...

Test 11

Verdict:

input
100000 1
1 2

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

user output
x0
0

Test 12

Verdict:

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

correct output
2
1 2
2 7

user output
x0
1
4 8