Task: | Connect cities |
Sender: | Nallue |
Submission time: | 2024-09-05 17:24:48 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | TIME LIMIT EXCEEDED |
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.38 s | details |
#7 | ACCEPTED | 0.39 s | details |
#8 | ACCEPTED | 0.40 s | details |
#9 | ACCEPTED | 0.40 s | details |
#10 | ACCEPTED | 0.39 s | details |
#11 | TIME LIMIT EXCEEDED | -- | details |
#12 | ACCEPTED | 0.00 s | details |
Compiler report
input/code.cpp: In function 'int checkVisited(const std::vector<bool>&)': input/code.cpp:8:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 8 | for(int i=0; i< visited.size(); i++){ | ~^~~~~~~~~~~~~~~~ input/code.cpp: In function 'int main()': input/code.cpp:36:28: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 36 | for(unsigned int i=0; i<m; i++){ | ~^~
Code
#include <iostream> #include <vector> #include <queue> using namespace std; int checkVisited(const vector<bool>& visited){ for(int i=0; i< visited.size(); i++){ if(visited[i]==false) return i; } return -1; } void BFS(vector<bool>& visited, vector<vector<int>>& roads, const int& init){ queue<int> q; q.push(init); while(not q.empty()) { int x = q.front(); q.pop(); for(unsigned int i=0; i<roads[x].size(); i++){ if(visited[roads[x][i]] == false) q.push(roads[x][i]); } visited[x] = true; } } int main(){ int n,m; cin >> n >> m; vector<bool> visited(n, false); vector<vector<int>> roads(n); for(unsigned int i=0; i<m; i++){ int a,b; cin >> a >> b; roads[a-1].push_back(b-1); roads[b-1].push_back(a-1); } vector<int> caps; int last = checkVisited(visited); caps.push_back(last); while (last != -1) { BFS(visited, roads, last); last = checkVisited(visited); if(last != -1)caps.push_back(last); } cout << caps.size()-1 << endl; for(unsigned int i=1; i<caps.size(); i++){ cout<<caps[0]+1<<" "<<caps[i]+1; cout << endl; } }
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 ... 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 1 7 1 9 1 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 1 20 1 27 1 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 1 7 1 11 1 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 1 18 1 21 1 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 1 2 1 7 |