Task: | Building Teams |
Sender: | joaquimballester |
Submission time: | 2024-09-09 16:49:59 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | WRONG ANSWER |
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 | WRONG ANSWER | 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 | WRONG ANSWER | 0.17 s | details |
#11 | WRONG ANSWER | 0.00 s | details |
#12 | WRONG ANSWER | 0.00 s | details |
Code
#include<iostream> #include<vector> using namespace std; vector<int> team; vector<vector<int>> adj; vector<bool> vis; bool dfs(int node, int ct) { vis[node] = 1; team[node] = ct; for (auto &i : adj[node]) { if (team[i] == 0) { bool temp = dfs(i, 3 - ct); if (not temp) return false; } else if (team[i] == ct) { return false; } } return true; } int main(){ int n,m; cin >> n >> m; team = vector<int> (n + 1); adj = vector<vector<int>> (n+1); vis = vector<bool> (n+1); for(int i = 0; i < m; ++i){ int a,b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } bool b = true; for (int i = 1; i <= n; i++) { if (vis[i]) continue; int res = dfs(i, 1); if (!res) { b = false; break; } } if (b) { for (int i = 1; i <= n; i++) cout << team[i] << " "; } }
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: WRONG ANSWER
input |
---|
10 20 3 5 8 10 9 10 1 8 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
(empty) |
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: WRONG ANSWER
input |
---|
100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
(empty) |
Test 11
Verdict: WRONG ANSWER
input |
---|
5 4 1 2 3 4 4 5 5 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
(empty) |
Test 12
Verdict: WRONG ANSWER
input |
---|
4 5 1 2 1 4 2 3 2 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
(empty) |