#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N=155,mod=1e9+7;
int t,n,col[N],ans[N];
main(){
cin>>n;
int cur = 0;
for(int i=n;i>=1;i--) {
for(int j=i; j<=n; j++) {
ans[j]++;
}
int l = i + 1, r = n,x = n + 1;
while(l<=r) {
int mid = (l+r)/2;
cout<<mid-i+1<<" ";
for(int j = i; j<=mid; j++) {
cout<<j<<" ";
}
cout<<endl;
int c = 0;
cin >> c;
if(c == ans[mid]) {
l = mid + 1;
}
else x = mid, r = mid - 1;
}
if(x <= n) {
col[i] = col[x];
for(int j=x;j<=n;j++) ans[j]--;
}
else col[i] = ++cur;
}
cout<<0<<" ";
for(int i=1;i<=n;i++) cout<<col[i]<<" ";
cout<<endl;
}
Compilation message
carnival.cpp:7:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
7 | main(){
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
200 KB |
Output is correct |
2 |
Correct |
14 ms |
200 KB |
Output is correct |
3 |
Correct |
9 ms |
200 KB |
Output is correct |
4 |
Correct |
13 ms |
200 KB |
Output is correct |
5 |
Correct |
9 ms |
200 KB |
Output is correct |
6 |
Correct |
12 ms |
200 KB |
Output is correct |
7 |
Correct |
11 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
200 KB |
Output is correct |
2 |
Correct |
14 ms |
200 KB |
Output is correct |
3 |
Correct |
12 ms |
200 KB |
Output is correct |
4 |
Correct |
17 ms |
200 KB |
Output is correct |
5 |
Correct |
10 ms |
200 KB |
Output is correct |
6 |
Correct |
11 ms |
200 KB |
Output is correct |
7 |
Correct |
11 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
200 KB |
Output is correct |
2 |
Correct |
13 ms |
200 KB |
Output is correct |
3 |
Correct |
16 ms |
200 KB |
Output is correct |
4 |
Correct |
19 ms |
200 KB |
Output is correct |
5 |
Correct |
12 ms |
200 KB |
Output is correct |
6 |
Correct |
13 ms |
200 KB |
Output is correct |
7 |
Correct |
11 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
200 KB |
Output is correct |
2 |
Correct |
12 ms |
200 KB |
Output is correct |
3 |
Correct |
22 ms |
200 KB |
Output is correct |
4 |
Correct |
15 ms |
200 KB |
Output is correct |
5 |
Correct |
13 ms |
312 KB |
Output is correct |
6 |
Correct |
13 ms |
200 KB |
Output is correct |
7 |
Correct |
14 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
220 KB |
Output is correct |
2 |
Correct |
12 ms |
200 KB |
Output is correct |
3 |
Correct |
13 ms |
200 KB |
Output is correct |
4 |
Correct |
19 ms |
200 KB |
Output is correct |
5 |
Correct |
15 ms |
200 KB |
Output is correct |
6 |
Correct |
20 ms |
200 KB |
Output is correct |
7 |
Correct |
18 ms |
200 KB |
Output is correct |