| Task: | Building Teams |
| Sender: | aalto26bm_048 |
| Submission time: | 2026-09-07 17:20:57 +0300 |
| Language: | C++ (C++23) |
| 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 | RUNTIME ERROR | 0.00 s | details |
| #6 | WRONG ANSWER | 0.33 s | details |
| #7 | WRONG ANSWER | 0.33 s | details |
| #8 | WRONG ANSWER | 0.33 s | details |
| #9 | WRONG ANSWER | 0.33 s | details |
| #10 | WRONG ANSWER | 0.33 s | details |
| #11 | RUNTIME ERROR | 0.00 s | details |
| #12 | RUNTIME ERROR | 0.00 s | details |
Code
#include <iostream>
#include <vector>
int main()
{
int n_pupils, n_friendships;
std::cin >> n_pupils >> n_friendships;
std::vector<std::vector<int>> adjacencies(n_pupils);
std::vector<bool> teams(n_pupils, false);
std::vector<bool> init(n_pupils, false);
std::vector<bool> discovered(n_pupils, false);
init[0] = true;
for (int i = 0; i < n_friendships; i++)
{
int a, b;
std::cin >> a >> b;
adjacencies[a].push_back(b);
adjacencies[b].push_back(a);
}
std::vector<int> dfs_stack = {0};
while (!dfs_stack.empty())
{
int v = dfs_stack.back();
dfs_stack.pop_back();
if (discovered[v])
continue;
discovered[v] = true;
bool team = teams[v];
for (int adjacency : adjacencies[v])
{
if (init[adjacency] && teams[adjacency] == team)
{
std::cout << "IMPOSSIBLE";
return 0;
}
dfs_stack.push_back(adjacency);
init[adjacency] = true;
teams[adjacency] = !team;
}
}
for (bool team : teams)
{
std::cout << (team ? "1" : "2") << std::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) |
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) |
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) |
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) |
Test 5
Verdict: RUNTIME ERROR
| input |
|---|
| 10 20 3 5 8 10 9 10 1 8 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |
Test 6
Verdict: WRONG ANSWER
| 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 |
|---|
| 2 2 2 2 2 ... |
Test 7
Verdict: WRONG ANSWER
| 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 |
|---|
| 2 2 2 2 2 ... |
Test 8
Verdict: WRONG ANSWER
| 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 |
|---|
| 2 2 2 2 2 ... |
Test 9
Verdict: WRONG ANSWER
| 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 |
|---|
| 2 2 2 2 2 ... |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| 2 2 2 2 2 ... |
Test 11
Verdict: RUNTIME ERROR
| input |
|---|
| 5 4 1 2 3 4 4 5 5 3 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |
Error:
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
Test 12
Verdict: RUNTIME ERROR
| input |
|---|
| 4 5 1 2 1 4 2 3 2 4 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |
