#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define ll long long
//#define endl "\n"
//int mod=1e9+7;
//const int N=2e5+5;
//template<class x>
//using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;
int n,c;
int col[155],nd[155];
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(".in", "r", stdin); freopen(".out", "w", stdout);
cin>>n;
col[1]=1; c=1;
for (int i=2;i<=n;i++) {
int cnt=0;
for (int j=1;j<=i;j++) {
if (nd[j]==0) cnt++;
}
cout<<cnt<<' ';
for (int j=1;j<=i;j++) {
if (nd[j]==0) {
cout<<j<<' ';
}
}
cout<<endl;
fflush(stdout);
int x; cin>>x;
if (x<cnt) {
for (int j=i-1;j>=1;j--) {
if (nd[j]!=0) continue;
cout<<j<<' '<<i<<endl;
fflush(stdout);
cin>>x;
if (x==1) {
nd[j]=1; col[i]=col[j]; break;
}
}
}
else {
c++; col[i]=c;
}
}
cout<<0<<' ';
for(int i=1;i<=n;i++) {
cout<<col[i]<<' ';
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1 ms |
208 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1 ms |
208 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
0 ms |
208 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
0 ms |
208 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1 ms |
208 KB |
Time limit exceeded (wall clock) |
2 |
Halted |
0 ms |
0 KB |
- |