# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29582 | rondojim | Carnival (CEOI14_carnival) | C++14 | 9 ms | 1116 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 <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
const int MAXN = 155;
int color[MAXN], inv[MAXN], N, d, s;
void ask_range(int l, int r){
printf("%d ", r - l + 1);
for(int i=l; i<=r; ++i) printf("%d ", i);
printf("\n");
fflush(stdout);
scanf("%d", &s);
}
void ask_color(int idx, int l, int r){
printf("%d %d ", r - l + 2, idx);
for(int i=l; i<=r; ++i) printf("%d ", inv[i]);
printf("\n");
fflush(stdout);
scanf("%d", &s);
}
int main(){
scanf("%d", &N);
color[1] = d = inv[1] = 1;
for(int i=2; i<=N; ++i){
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... |