Task: | Building Teams |
Sender: | snude |
Submission time: | 2024-09-09 16:54:19 +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 | WRONG ANSWER | 0.17 s | details |
#7 | WRONG ANSWER | 0.17 s | details |
#8 | WRONG ANSWER | 0.17 s | details |
#9 | WRONG ANSWER | 0.17 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 <cstdio> #include <iostream> #include <queue> #include <utility> #include <vector> using namespace std; // Depth first search void dfs(int s, bool visited[], vector<int> adj[]) { if (visited[s]) { return; }; visited[s] = true; for (auto u: adj[s]) { dfs(u, visited, adj); } } int main (int argc, char *argv[]) { int n, m; cin >> n >> m; vector<pair<int, int>> friends(m); for (int i = 0; i < m; i++) { cin >> friends[i].first >> friends[i].second; } // 0 is not included in cities vector<int> adj[n + 1]; bool visited[n + 1]; for (int i = 0; i < n + 1; i++) visited[i] = false; // Add roads to adjacent structure for (int j = 0; j < m; j++) { adj[friends[j].first].push_back(friends[j].second); adj[friends[j].second].push_back(friends[j].first); } queue<int> q; int distance[n + 1]; distance[1] = 0; q.push(1); while (!q.empty()) { int s = q.front(); q.pop(); for (auto u : adj[s]) { if (visited[u]) continue; visited[u] = true; distance[u] = distance[s]+1; q.push(u); } } int k = 1; while (!visited[k]) { visited[1] = true; while (!q.empty()) { int s = q.front(); q.pop(); for (auto u : adj[s]) { if (visited[u]) continue; visited[u] = true; distance[u] = distance[s]+1; q.push(u); } } // find next unconnected component for (int i = k; i < n + 1; i++) { if (!visited[i]) { k = i; break; } } } for (int i = 1; i < n + 1; i++) { if (distance[i] % 2) { cout << "1 "; } else { cout << "2 "; } } /*for (int a = 0; a < n + 1; a++) {*/ /* cout << a << ": " << visited[a] << "\n";*/ /*}*/ /*std::cout << added << "\n";*/ /*for (auto u: added_edges) {*/ /* cout << u - 1 << " " << u << "\n";*/ /*}*/ return 0; }
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: WRONG ANSWER
input |
---|
10 20 3 5 8 10 9 10 1 8 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
2 2 2 1 2 2 1 1 1 2 |
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 1 1 2 1 2 2 2 1 1 2 1 2 2 2 ... Truncated |
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 1 1 2 2 1 2 1 2 1 1 1 2 ... Truncated |
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 1 2 2 1 2 1 1 1 2 1 2 2 1 2 ... Truncated |
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 1 1 1 2 2 1 1 1 1 1 2 1 2 ... Truncated |
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 2 1 2 1 2 2 2 2 1 2 ... Truncated |
Test 11
Verdict: WRONG ANSWER
input |
---|
5 4 1 2 3 4 4 5 5 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
2 1 1 2 1 |
Test 12
Verdict: WRONG ANSWER
input |
---|
4 5 1 2 1 4 2 3 2 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
2 1 2 1 |