# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
346932 | jamezzz | Carnival (CEOI14_carnival) | C++14 | 21 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n, ft[155], col[155];
void up(int x, int v){
while (x <= n){
ft[x] += v;
x += x & -x;
}
}
int qry(int x){
int res = 0;
while (x){
res += ft[x];
x -= x & -x;
}
return res;
}
int query(int x, int y){
printf("%d ", y - x + 1);
for (int i = x; i <= y; ++i){
printf("%d ", i);
}
printf("\n"); fflush(stdout);
int t; scanf("%d", &t);
return t;
}
int main(){
scanf("%d", &n);
int cur = 1;
for (int i = 1; i <= n; ++i){
int t = query(1, i);
up(i, t); up(i + 1, -t);
if (qry(i) != qry(i - 1)) col[i] = cur++;
}
col[1] = 1; up(1, -1);
for (int i = 2; i <= n; ++i){
int lo = i, hi = n, mid, res = n + 1;
while (lo <= hi){
mid = (lo + hi) / 2;
if (query(i, mid) != qry(mid)){
hi = mid - 1; res = mid;
}
else{
lo = mid + 1;
}
}
col[res] = col[i - 1];
up(res, 1); up(i, -1);
}
printf("0 ");
for (int i = 1; i <= n; ++i) printf("%d ", col[i]);
fflush(stdout);
return 0;
}
//1 2 1 3 2 3
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |