# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
534623 | 2022-03-08T12:10:27 Z | shrimb | Carnival (CEOI14_carnival) | C++17 | 0 ms | 0 KB |
#include"bits/stdc++.h" #define int long long // #define endl '\n' using namespace std; int dsu[2000001]; int ans[2000001]; int Find (int x) { return dsu[x] == x ? x : dsu[x] = Find(dsu[x]); } void Union (int a, int b) { dsu[Find(a)] = Find(b); } bool Query (int a, int b) { cout << "2 " << a << " " << b << endl; int x; cin >> x; return x == 1; } signed main () { int n; cin >> n; for (int i = 1 ; i <= n ; i++) dsu[u] = i; for (int i = 1 ; i <= n ; i++) { bitset<151> vis; vis[i] = 1; for (int j = 0 ; j < 30 ; j++) { int x = rand() % n + 1; if (vis[x]) {j-=vis.count() < n; continue;} else { vis[x] = 1; if (Query(i, x)) Union(i, x); } } } int c = 1; for (int i = 1 ; i <= n ; i++) if (dsu[i] == i) ans[i] = c++; cout << 0 << " "; for (int i = 1 ; i <= n ; i++) cout << ans[Find(i)] << " "; }