Task: | Connect cities |
Sender: | ashum-ta |
Submission time: | 2024-09-04 16:06:23 +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.11 s | details |
#7 | ACCEPTED | 0.11 s | details |
#8 | ACCEPTED | 0.11 s | details |
#9 | ACCEPTED | 0.11 s | details |
#10 | ACCEPTED | 0.11 s | details |
#11 | ACCEPTED | 0.02 s | details |
#12 | ACCEPTED | 0.00 s | details |
Code
#include <iostream>#include <vector>using namespace std;void colorComponent(int v, int color, vector<int>& colors, vector<vector<int>>& g){colors[v] = color;for (auto u : g[v])if (colors[u] == 0)colorComponent(u, color, colors, g);}int main(){ios::sync_with_stdio(false);int n = 0, m = 0;cin >> n >> m;vector<vector<int>> g(n);int u = 0, v = 0;for (int i = 0; i < m; ++i){cin >> u >> v;--u, --v;g[u].push_back(v);g[v].push_back(u);}int curColor = 1;int lastV = -1;vector<int> colors(n);vector<pair<int, int>> toBuild;for (int i = 0; i < n; ++i){if (colors[i] != 0)continue;colorComponent(i, curColor++, colors, g);if (lastV != -1)toBuild.emplace_back(lastV, i);lastV = i;}cout << toBuild.size() << "\n";for (const auto& [from, to] : toBuild)cout << from + 1 << " " << to + 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 |