#include <bits/stdc++.h>
using namespace std;
const int nx=155;
int n, res, cnt, vs[nx], ans[nx];
vector<int> d[nx];
int query(int a, int b)
{
cout<<2<<' '<<a<<' '<<b<<'\n';
cin>>res;
return res;
}
void dfs(int u, int p)
{
vs[u]=1;
ans[u]=cnt;
for (auto v:d[u]) if (v!=p&&!vs[v]) dfs(v, u);
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) for (int j=i+1; j<=n; j++) if (query(i, j)==2) d[i].push_back(j), d[j].push_back(i);
for (int i=1; i<=n; i++) if (!vs[i]) cnt++, dfs(i, i);
cout<<0;
for (int i=1; i<=n; i++) cout<<' '<<ans[i];
cout<<'\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
0 ms |
344 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1 ms |
344 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
0 ms |
344 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
0 ms |
344 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
0 ms |
344 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |