| Task: | 3-Coloring |
| Sender: | ariadna.roga |
| Submission time: | 2025-11-26 17:24:29 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | WRONG ANSWER | 0.00 s | details |
| #3 | WRONG ANSWER | 0.00 s | details |
| #4 | WRONG ANSWER | 0.00 s | details |
| #5 | WRONG ANSWER | 0.00 s | details |
| #6 | WRONG ANSWER | 0.00 s | details |
| #7 | WRONG ANSWER | 0.00 s | details |
| #8 | WRONG ANSWER | 0.00 s | details |
| #9 | WRONG ANSWER | 0.00 s | details |
| #10 | WRONG ANSWER | 0.00 s | details |
| #11 | WRONG ANSWER | 0.00 s | details |
| #12 | WRONG ANSWER | 0.01 s | details |
| #13 | WRONG ANSWER | 0.05 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
// 3-coloring problem
int main()
{
// ios_base::sync_with_stdio(0);
// cin.tie(0);
int n;
cin >> n;
vector<int> edges(n);
for (int i = 0; i < n; ++i) {
cin >> edges[i];
edges[i]--;
}
vector<int> color(n, 0);
for (int i = 0; i < n; ++i) {
// free to color
if (color[i] == 0) {
int actual = i;
color[actual] = 1;
while (true) {
int next = edges[actual];
if (color[next] == 0) {
color[next] = (color[actual] % 3) + 1;
actual = next;
} else {
break;
}
}
}
}
for (int i = 0; i < n; ++i) {
cout << color[i] << " ";
}
cout << endl;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 2 2 1 |
| correct output |
|---|
| 1 2 |
| user output |
|---|
| 1 2 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 3 2 1 1 |
| correct output |
|---|
| 1 2 2 |
| user output |
|---|
| 1 2 1 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 4 3 1 4 2 |
| correct output |
|---|
| 1 2 2 1 |
| user output |
|---|
| 1 1 2 3 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 5 5 5 1 5 4 |
| correct output |
|---|
| 1 1 2 1 2 |
| user output |
|---|
| 1 1 1 3 2 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 10 3 1 9 9 3 4 10 10 5 1 |
| correct output |
|---|
| 1 2 2 2 3 1 1 1 1 2 |
| user output |
|---|
| 1 1 2 1 1 1 1 1 3 2 |
Test 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 9 10 4 3 9 1 1 4 2 6 |
| correct output |
|---|
| 1 1 1 2 1 3 2 1 2 2 |
| user output |
|---|
| 1 3 1 2 1 2 1 1 2 1 |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 10 3 8 4 5 10 8 5 10 4 6 |
| correct output |
|---|
| 1 1 2 1 2 2 1 3 2 1 |
| user output |
|---|
| 1 1 2 3 1 3 1 1 1 2 |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 10 9 1 10 3 9 4 6 9 3 5 |
| correct output |
|---|
| 1 2 1 2 1 1 2 1 2 2 |
| user output |
|---|
| 1 1 3 1 2 1 1 1 2 1 |
Test 9
Verdict: WRONG ANSWER
| input |
|---|
| 10 4 6 5 5 1 2 4 2 1 3 |
| correct output |
|---|
| 1 1 1 2 3 2 1 2 2 2 |
| user output |
|---|
| 1 1 1 2 3 2 1 1 1 1 |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 100 19 7 2 67 47 20 73 93 43 11 49... |
| correct output |
|---|
| 1 1 2 1 1 1 3 2 1 2 1 1 2 1 1 ... |
| user output |
|---|
| 1 2 1 1 1 3 3 3 1 1 3 1 1 1 1 ... |
Test 11
Verdict: WRONG ANSWER
| input |
|---|
| 1000 155 447 741 874 264 87 534 724... |
| correct output |
|---|
| 1 1 2 1 1 1 1 1 1 1 1 2 1 2 2 ... |
| user output |
|---|
| 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 ... |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 10000 7778 6074 2376 8595 8243 8930 ... |
| correct output |
|---|
| 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
Test 13
Verdict: WRONG ANSWER
| input |
|---|
| 100000 51396 92191 77318 65910 87045 ... |
| correct output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
