| Task: | Connect cities |
| Sender: | aalto26bh_050 |
| Submission time: | 2026-09-04 17:41:43 +0300 |
| Language: | C++ (C++20) |
| 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.25 s | details |
| #7 | ACCEPTED | 0.25 s | details |
| #8 | ACCEPTED | 0.25 s | details |
| #9 | ACCEPTED | 0.25 s | details |
| #10 | ACCEPTED | 0.25 s | details |
| #11 | ACCEPTED | 0.05 s | details |
| #12 | ACCEPTED | 0.00 s | details |
Code
#include <iostream>
#include <list>
using namespace std;
class city
{
private:
list<city*>* connected;
public:
bool been = false;
city(){
connected = new list<city*>;
};
~city(){};
void connect(city* other) {
connected->push_back(other);
other->connected->push_back(this);
};
void visitGroup() {
list<city*>* group = new list<city*>;
group->push_back(this);
for (auto c=group->begin(); c!=group->end(); c++) {
city* cc = *c;
if (cc->been) {
continue;
}
else {
cc->been = true;
for (auto c2=cc->connected->begin(); c2!=cc->connected->end(); c2++) {
if (!(*c2)->been) {
group->push_back(*c2);
}
}
}
}
}
};
int main() {
int n, m;
cin >> n >> m;
city* cities = new city[n];
for (int i=0; i<m; i++) {
int a, b;
cin >> a >> b;
cities[a-1].connect(&cities[b-1]);
}
list<int> groups = {};
for (int i=0; i<n; i++) {
if (!cities[i].been) {
groups.push_back(i);
cities[i].visitGroup();
}
}
cout << groups.size() - 1 << endl;
for (auto i=++groups.begin(); i!=groups.end(); i++) {
cout << *groups.begin() + 1 << " " << *i + 1 << "\n";
}
delete[] cities;
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 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 |
