# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574752 | 1zaid1 | Carnival (CEOI14_carnival) | C++14 | 95 ms | 336 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 <bits/stdc++.h>
using namespace std;
// #define endl '\n'
const int M = 2e5+5, MOD = 1000000007;
#define int long long
int rnk[M], clr[M], p[M];
int find(int s) {
return (s == p[s]?s:p[s]=find(p[s]));
}
void uni(int a, int b) {
if (rnk[a] < rnk[b]) swap(a, b);
if (rnk[a] == rnk[b]) rnk[a]++;
p[b] = a;
clr[a] = min(clr[a], clr[b]);
}
signed main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) clr[i] = p[i] = i;
for (int i=1;i<=n;i++) {
for(int j=i+1;j<=n;j++) {
if (find(i) != find(j)) {
cout << 2 << ' ' << i << ' ' << j << endl;
int x;
cin >> x;
if (x == 1) uni(find(i), find(j));
}
}
}
cout << 0 << ' ';
for (int i = 1; i <= n; i++) cout << clr[find(i)] << ' '; cout << endl;
return 0;
}
/*
3
0 3 0
3 0 0
5 4 0
3
1 1 1
3 0 1
4 5 1
*/
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... |