| Task: | Connect cities |
| Sender: | usvafe |
| Submission time: | 2025-09-03 23:53:16 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | ACCEPTED | 0.01 s | details |
| #3 | ACCEPTED | 0.01 s | details |
| #4 | ACCEPTED | 0.01 s | details |
| #5 | ACCEPTED | 0.01 s | details |
| #6 | ACCEPTED | 0.19 s | details |
| #7 | ACCEPTED | 0.19 s | details |
| #8 | ACCEPTED | 0.20 s | details |
| #9 | ACCEPTED | 0.19 s | details |
| #10 | ACCEPTED | 0.19 s | details |
| #11 | ACCEPTED | 0.03 s | details |
| #12 | ACCEPTED | 0.01 s | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:40:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
40 | for (int i=0; i<rc.size()-1; i++) {
| ~^~~~~~~~~~~~Code
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
vector<int> adj[N];
bool visited[N];
int dfs(int s) {
if (visited[s]) return 0;
visited[s] = true;
int vis = 0;
for (int nb : adj[s]) {
vis += dfs(nb);
}
return vis + 1;
}
int main() {
int n, m, a, b;
cin >> n >> m;
for (int i=0; i<m; i++) {
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
int dis = 0;
int vis = 0;
vector<int> rc;
for (int i=1; i<=n; i++) {
int v = dfs(i);
if (v) {
dis += 1;
vis += v;
rc.push_back(i);
}
if (vis == n) break;
}
cout << dis-1 << "\n";
for (int i=0; i<rc.size()-1; i++) {
cout << rc[i] << " " << rc[i+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 1 2 2 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 4 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 2 3 3 4 4 5 ... 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 1 2 2 7 7 9 9 15 ... 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 1 9 9 20 20 27 27 28 ... 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 1 6 6 7 7 11 11 12 ... 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 1 2 2 18 18 21 21 27 ... Truncated |
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 3 4 4 5 5 6 ... 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 1 2 2 7 |
