Task: | Building Teams |
Sender: | bielaltes |
Submission time: | 2024-09-09 16:35:15 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | RUNTIME ERROR |
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 | RUNTIME ERROR | 0.00 s | details |
#6 | ACCEPTED | 0.20 s | details |
#7 | ACCEPTED | 0.20 s | details |
#8 | ACCEPTED | 0.20 s | details |
#9 | ACCEPTED | 0.20 s | details |
#10 | RUNTIME ERROR | 0.17 s | details |
#11 | RUNTIME ERROR | 0.00 s | details |
#12 | RUNTIME ERROR | 0.00 s | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 48 | for (int i = 1; i < colours.size(); ++i) { | ~~^~~~~~~~~~~~~~~~ input/code.cpp:50:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 50 | if (i +1 != colours.size()) | ~~~~~^~~~~~~~~~~~~~~~~
Code
#include <iostream> #include <vector> #include <algorithm> #include <bits/stdc++.h> using namespace std; void dfs_bipartite(int node, int new_col, const vector<vector<int>>& friends, vector<int>& colours) { colours[node] = new_col; for (int neighbor : friends[node]) { if (!colours[neighbor]) { if (new_col == 1) dfs_bipartite(neighbor, 2, friends, colours); else dfs_bipartite(neighbor, 1, friends, colours); } else if (colours[neighbor] && colours[neighbor] == colours[node]){ cout << "IMPOSSIBLE" << endl; exit(1); } } } int main() { int n, m; cin >> n >> m; vector< vector<int> > friends = vector<vector<int> >(n+1); for (int i = 0; i < m; ++i) { int aux1, aux2; cin >> aux1 >> aux2; friends[aux1].push_back(aux2); friends[aux2].push_back(aux1); } vector<int> colours(n + 1, 0); for (int i = 1; i <= n; ++i) { if (!colours[i]) { dfs_bipartite(i, 1, friends, colours); } } for (int i = 1; i < colours.size(); ++i) { cout << colours[i]; if (i +1 != colours.size()) cout << " "; } cout << endl; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
10 20 3 4 8 10 3 7 1 8 ... |
correct output |
---|
1 1 1 2 2 1 2 2 2 1 |
user output |
---|
1 1 1 2 2 1 2 2 2 1 |
Test 2
Verdict: ACCEPTED
input |
---|
10 20 1 3 8 10 2 4 6 8 ... |
correct output |
---|
1 1 2 2 1 1 1 2 1 1 |
user output |
---|
1 1 2 2 1 1 1 2 1 1 |
Test 3
Verdict: ACCEPTED
input |
---|
10 20 7 10 3 10 9 10 2 10 ... |
correct output |
---|
1 2 2 1 1 1 2 1 2 1 |
user output |
---|
1 2 2 1 1 1 2 1 2 1 |
Test 4
Verdict: ACCEPTED
input |
---|
10 20 2 4 2 10 7 10 4 6 ... |
correct output |
---|
1 2 1 1 2 2 2 1 2 1 |
user output |
---|
1 2 1 1 2 2 2 1 2 1 |
Test 5
Verdict: RUNTIME ERROR
input |
---|
10 20 3 5 8 10 9 10 1 8 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Verdict: ACCEPTED
input |
---|
100000 200000 47355 96505 90709 92058 735 80715 91802 94265 ... |
correct output |
---|
1 2 2 1 2 1 1 1 2 2 1 2 1 1 1 ... |
user output |
---|
1 2 2 1 2 1 1 1 2 2 1 2 1 1 1 ... Truncated |
Test 7
Verdict: ACCEPTED
input |
---|
100000 200000 59991 95794 95150 96051 78453 94730 90411 95523 ... |
correct output |
---|
1 1 1 2 2 1 1 2 1 2 1 2 2 2 1 ... |
user output |
---|
1 1 1 2 2 1 1 2 1 2 1 2 2 2 1 ... Truncated |
Test 8
Verdict: ACCEPTED
input |
---|
100000 200000 89827 96402 65137 86792 80965 94708 19479 48078 ... |
correct output |
---|
1 2 1 1 2 1 2 2 2 1 2 1 1 2 1 ... |
user output |
---|
1 2 1 1 2 1 2 2 2 1 2 1 1 2 1 ... Truncated |
Test 9
Verdict: ACCEPTED
input |
---|
100000 200000 72952 83723 66197 70052 2949 52160 55753 95651 ... |
correct output |
---|
1 1 2 2 2 1 1 2 2 2 2 2 1 2 1 ... |
user output |
---|
1 1 2 2 2 1 1 2 2 2 2 2 1 2 1 ... Truncated |
Test 10
Verdict: RUNTIME ERROR
input |
---|
100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 11
Verdict: RUNTIME ERROR
input |
---|
5 4 1 2 3 4 4 5 5 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 12
Verdict: RUNTIME ERROR
input |
---|
4 5 1 2 1 4 2 3 2 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |