| Task: | Connect cities |
| Sender: | Olivernator |
| Submission time: | 2025-09-07 16:50:45 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | WRONG ANSWER | 0.00 s | details |
| #3 | WRONG ANSWER | 0.00 s | details |
| #4 | WRONG ANSWER | 0.00 s | details |
| #5 | WRONG ANSWER | 0.00 s | details |
| #6 | WRONG ANSWER | 0.21 s | details |
| #7 | WRONG ANSWER | 0.21 s | details |
| #8 | WRONG ANSWER | 0.22 s | details |
| #9 | WRONG ANSWER | 0.21 s | details |
| #10 | WRONG ANSWER | 0.21 s | details |
| #11 | TIME LIMIT EXCEEDED | -- | details |
| #12 | ACCEPTED | 0.00 s | details |
Compiler report
input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
8 | scanf("%d %d",&n,&m);
| ~~~~~^~~~~~~~~~~~~~~
input/code.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
15 | scanf("%d %d", &a, &b);
| ~~~~~^~~~~~~~~~~~~~~~~Code
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n,m;
scanf("%d %d",&n,&m);
vector<vector<int>> adj(n,vector<int>());
int *visited = (int *)calloc(n,sizeof(int));
for (int i = 0; i < m; i++) {
int a,b;
scanf("%d %d", &a, &b);
adj[a-1].push_back(b-1);
adj[b-1].push_back(a-1);
}
int unvisited = -1, lastvisited = 0, exists_unvisited = 0;
do{
exists_unvisited = 0;
queue<int> q;
if (unvisited > 0){
adj[lastvisited].push_back(unvisited);
}
q.push(lastvisited);
while (!q.empty()) {
int current = q.front();
for (const int &i : adj[current]) {
if(!visited[i]){
q.push(i);
}
} visited[current] = 1;
lastvisited = current;
q.pop();
}
for (int i = 0; i < n; i++) {
if (visited[i] == 0){
unvisited = i;
exists_unvisited = 1;
printf("%d %d\n",i+1, lastvisited+1);
break;
}
}
} while(exists_unvisited);
free(visited);
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 10 7 9 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 3 9 6 8 9 10 7 8 ... |
| correct output |
|---|
| 2 1 4 4 5 |
| user output |
|---|
| 4 2 5 4 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 7 9 1 7 1 3 3 4 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 8 5 9 4 9 2 7 ... |
| correct output |
|---|
| 1 1 3 |
| user output |
|---|
| 3 10 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 9 2 4 7 10 1 8 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 6
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 7233 22146 94937 96203 6133 10731 98737 99193 ... |
| correct output |
|---|
| 4785 1 2 2 3 3 4 4 5 ... |
| user output |
|---|
| 2 1 3 38712 4 3 5 37104 11 45852 ... Truncated |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 92950 93575 24401 88897 41796 99364 47106 50330 ... |
| correct output |
|---|
| 4868 1 2 2 7 7 9 9 15 ... |
| user output |
|---|
| 2 1 7 30175 9 7 15 9 16 15 ... Truncated |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 15637 76736 79169 98809 4382 86557 73383 77029 ... |
| correct output |
|---|
| 4683 1 9 9 20 20 27 27 28 ... |
| user output |
|---|
| 9 29082 20 9 27 20 28 27 33 28 ... Truncated |
Test 9
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 47932 66981 86401 99942 4353 27841 60492 67345 ... |
| correct output |
|---|
| 4807 1 6 6 7 7 11 11 12 ... |
| user output |
|---|
| 6 72405 7 7243 11 34796 12 11 30 12 ... Truncated |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 6554 44548 76413 98555 5447 59589 70166 74434 ... |
| correct output |
|---|
| 4786 1 2 2 18 18 21 21 27 ... |
| user output |
|---|
| 2 48482 18 4194 21 18 27 21 28 27 ... Truncated |
Test 11
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 1 1 2 |
| correct output |
|---|
| 99998 1 3 3 4 4 5 5 6 ... |
| user output |
|---|
| (empty) |
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 10 7 9 |
