#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(vector<int> v)
{
cout<<v.size()<<' ';
for (auto x:v) cout<<x<<' ';
fflush(stdout);
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>>n;
for (int i=1; i<=n; i++) for (int j=i+1; j<=n; j++) if (query(vector<int> {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]<<' ';
return 0;
}
/*
7
1 2 3 1 2 3 1
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
53 ms |
1212 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
52 ms |
1236 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
39 ms |
344 KB |
Integer 2 violates the range [1, 1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
50 ms |
980 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
60 ms |
956 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |