Task: | Building Teams |
Sender: | arnxxau |
Submission time: | 2024-09-09 17:37:29 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | RUNTIME ERROR |
test | verdict | time | |
---|---|---|---|
#1 | RUNTIME ERROR | 0.00 s | details |
#2 | RUNTIME ERROR | 0.00 s | details |
#3 | RUNTIME ERROR | 0.00 s | details |
#4 | RUNTIME ERROR | 0.00 s | details |
#5 | ACCEPTED | 0.00 s | details |
#6 | RUNTIME ERROR | 0.39 s | details |
#7 | RUNTIME ERROR | 0.39 s | details |
#8 | RUNTIME ERROR | 0.39 s | details |
#9 | RUNTIME ERROR | 0.39 s | details |
#10 | RUNTIME ERROR | 0.39 s | details |
#11 | ACCEPTED | 0.00 s | details |
#12 | ACCEPTED | 0.00 s | details |
Code
#include <algorithm> #include <iostream> #include <queue> #include <vector> using namespace std; int main() { int n_pupils, n_friendships; cin >> n_pupils >> n_friendships; vector<vector<bool> > friendships(n_pupils, vector<bool>(n_pupils, false)); vector<bool> visited(n_pupils, false); vector<int> team(n_pupils, -1); for (int i = 0; i < n_friendships; ++i) { int a, b; cin >> a >> b; friendships[a - 1][b - 1] = true; friendships[b - 1][a - 1] = true; } vector<pair<int, int> > teams; bool all_visited = false; bool impossible = false; while (not all_visited and not impossible) { all_visited = true; int k = 0; all_visited = visited[k]; while (all_visited and k < n_pupils) { all_visited = visited[k]; ++k; } queue<int> q; visited[k] = true; team[k] = 1; q.push(k); while (!q.empty() and not all_visited and not impossible) { int curr = q.front(); q.pop(); for (int i = 0; i < n_pupils; ++i) { if (friendships[curr][i] and team[curr] != -1 and team[curr] == team[i]) impossible = true; if (friendships[curr][i] and not visited[i] and not impossible) { q.push(i); visited[i] = true; if (team[curr] == 1) team[i] = 2; else team[i] = 1; } } } } if (not impossible) for (int i = 0; i < n_pupils; ++i) cout << team[i] << " "; else cout << "IMPOSSIBLE"; cout << endl; }
Test details
Test 1
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
free(): invalid pointer
Test 2
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
free(): invalid pointer
Test 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
free(): invalid pointer
Test 4
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
free(): invalid pointer
Test 5
Verdict: ACCEPTED
input |
---|
10 20 3 5 8 10 9 10 1 8 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 7
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 8
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 9
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Test 10
Verdict: RUNTIME ERROR
input |
---|
100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
(empty) |
Test 11
Verdict: ACCEPTED
input |
---|
5 4 1 2 3 4 4 5 5 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 12
Verdict: ACCEPTED
input |
---|
4 5 1 2 1 4 2 3 2 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |