# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239850 | brainwarego | Carnival (CEOI14_carnival) | C++14 | 4 ms | 384 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 <cstdio>
int group[160] = {0, 1};
int entry[160] = {1}, en = 1, arr[160];
int party(int len, int*ap){
printf("%d ", len);
for(int i=0;i<len;++i) printf("%d ", ap[i]);
puts("");
int response;
scanf("%d", &response);
return response;
}
int bsearch(int s, int e, int tg){
int i, m, ans = s, ed;
while(s <= e){
m = (s + e) / 2;
ed = m - s + 1;
for(i=0;i<ed;++i) arr[i] = entry[s+i];
arr[ed] = tg;
if(party(ed+1, arr) < ed+1){
ans = m, e = m-1;
}
else s = m+1;
}
return group[entry[ans]];
}
int main(){
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... |