| Task: | Building Teams |
| Sender: | aalto26bm_026 |
| Submission time: | 2026-09-07 16:29:24 +0300 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | ACCEPTED |
| 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 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.21 s | details |
| #7 | ACCEPTED | 0.21 s | details |
| #8 | ACCEPTED | 0.21 s | details |
| #9 | ACCEPTED | 0.22 s | details |
| #10 | ACCEPTED | 0.18 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
Compiler report
input/code.cpp: In function 'void dfs(const std::vector<std::vector<int> >&, std::vector<int>&)':
input/code.cpp:25:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
25 | for (int i = 0; i < adj.size(); i++)
| ~~^~~~~~~~~~~~Code
#include <iostream>
#include <vector>
using namespace std;
void dfs_rec(int s, const vector<vector<int>>& adj, vector<int>& vis, int team)
{
if (vis[s] >= 0) return;
vis[s] = team;
for (auto u : adj[s])
{
if (vis[u] == team)
{
cout << "IMPOSSIBLE" << endl;
exit(0);
}
int newTeam;
team == 1 ? newTeam = 0 : newTeam = 1;
dfs_rec(u, adj, vis, newTeam);
}
}
void dfs(const vector<vector<int>>& adj, vector<int>& vis)
{
for (int i = 0; i < adj.size(); i++)
{
if (vis[i] >= 0) continue;
else
{
dfs_rec(i, adj, vis, 1);
}
}
return;
}
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n);
vector<int> vis(n, -1);
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(adj, vis);
for (int i = 0; i < n; i++)
{
cout << vis[i] + 1 << " ";
}
}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 |
|---|
| 2 2 2 1 1 2 1 1 1 2 |
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 |
|---|
| 2 2 1 1 2 2 2 1 2 2 |
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 |
|---|
| 2 1 1 2 2 2 1 2 1 2 |
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 |
|---|
| 2 1 2 2 1 1 1 2 1 2 |
Test 5
Verdict: ACCEPTED
| 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 |
|---|
| 2 1 1 2 1 2 2 2 1 1 2 1 2 2 2 ... |
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 |
|---|
| 2 2 2 1 1 2 2 1 2 1 2 1 1 1 2 ... |
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 |
|---|
| 2 1 2 2 1 2 1 1 1 2 1 2 2 1 2 ... |
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 |
|---|
| 2 2 1 1 1 2 2 1 1 1 1 1 2 1 2 ... |
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: ACCEPTED
| input |
|---|
| 4 5 1 2 1 4 2 3 2 4 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
