# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100929 | E869120 | Carnival (CEOI14_carnival) | C++14 | 99 ms | 2988 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
using namespace std;
vector<int>X[100009]; int n, col[1009], cnts;
void dfs(int pos) {
if (col[pos] >= 1) return;
col[pos] = cnts;
for (int i = 0; i < X[pos].size(); i++) dfs(X[pos][i]);
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
cout << "2 " << i << " " << j << endl;
int p; cin >> p;
if (p == 1) { X[i].push_back(j); X[j].push_back(i); }
}
}
for (int i = 1; i <= n; i++) {
if (col[i] >= 1) continue;
cnts++; dfs(i);
}
cout << "0";
for (int i = 1; i <= n; i++) cout << " " << col[i]; cout << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |