Task: | Building Teams |
Sender: | fabiank |
Submission time: | 2024-09-09 16:45:03 +0300 |
Language: | C++ (C++17) |
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 | ACCEPTED | 0.19 s | details |
#11 | ACCEPTED | 0.00 s | details |
#12 | WRONG ANSWER | 0.00 s | details |
Code
#include <iostream> #include <vector> #include <algorithm> #include <queue> #include <unordered_set> #include <unordered_map> using namespace std; bool dfs(int pupil, vector<int> &assignments, const vector<vector<int>> &friends, int team); int main() { int n, m; cin >> n >> m; vector<vector<int>> friends(n + 1); for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; friends[a].push_back(b); friends[b].push_back(a); } vector<int> assignments(n + 1, 0); for (int pupil = 1; pupil <= n; pupil++) { if (assignments[pupil] == 0) { bool result = dfs(pupil, assignments, friends, 1); if (result == false) { cout << "IMPOSSIBLE\n"; return 0; } } } for (int i = 1; i <= n; i++) { cout << assignments[i] << " "; } cout << "\n"; } bool dfs(int pupil, vector<int> &assignments, const vector<vector<int>> &friends, int team) { int other_team = team == 1 ? 2 : 1; if (assignments[pupil] == other_team) { return false; } assignments[pupil] = team; for (int f : friends[pupil]) { int assignment_friend = assignments[f]; if (assignment_friend == team) { return false; } else if (assignment_friend == 0) { dfs(f, assignments, friends, other_team); } } return true; }
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 |
---|
1 1 2 2 1 1 2 2 2 1 |
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: ACCEPTED
input |
---|
100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 11
Verdict: ACCEPTED
input |
---|
5 4 1 2 3 4 4 5 5 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 12
Verdict: WRONG ANSWER
input |
---|
4 5 1 2 1 4 2 3 2 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
1 2 1 2 |