| Task: | Connect cities |
| Sender: | tjaa |
| Submission time: | 2025-09-08 15:22:25 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.19 s | details |
| #7 | ACCEPTED | 0.20 s | details |
| #8 | ACCEPTED | 0.19 s | details |
| #9 | ACCEPTED | 0.19 s | details |
| #10 | ACCEPTED | 0.19 s | details |
| #11 | ACCEPTED | 0.03 s | details |
| #12 | ACCEPTED | 0.00 s | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:32:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | for(int c = 1; c < ne.size(); c++) {
| ~~^~~~~~~~~~~Code
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int n, m;
cin >> n >> m;
vector<vector<int>> roads(n+1);
for (int i = 0; i < m; i++){
int c, c2;
cin >> c >> c2;
roads[c].push_back(c2);
roads[c2].push_back(c);
}
vector<int> v(n+1);
vector<int> ne;
stack<int> s;
for(int i = 1; i <= n; i++) {
s.push(i);
while(!s.empty()) {
auto c = s.top(); s.pop();
if(!v[c]) {
v[c] = 1;
if(i == c) ne.push_back(c);
for(const auto& r : roads[c]) s.push(r);
}
}
}
int count = max(0, (int)ne.size()-1);
cout << count << '\n';
for(int c = 1; c < ne.size(); c++) {
cout << ne[c] << ' ' << ne[c-1] << '\n';
}
return 0;
}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 2 1 7 2 |
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 4 1 5 4 |
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 3 1 |
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 2 1 3 2 4 3 5 4 ... Truncated |
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 2 1 7 2 9 7 15 9 ... Truncated |
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 9 1 20 9 27 20 28 27 ... Truncated |
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 6 1 7 6 11 7 12 11 ... Truncated |
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 2 1 18 2 21 18 27 21 ... Truncated |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 100000 1 1 2 |
| correct output |
|---|
| 99998 1 3 3 4 4 5 5 6 ... |
| user output |
|---|
| 99998 3 1 4 3 5 4 6 5 ... Truncated |
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 2 1 7 2 |
