oj.uz

Submission #113237

# Submission time Handle Problem Language Result Execution time Memory
113237 2019-05-24T11:45:20 Z brcode Carnival (CEOI14_carnival) C++14
0 / 100
 4 ms 384 KB 
#include <iostream>

using namespace std;
const int MAXN = 155;
int counter = 1;
int arr[MAXN];
int maxsz;
int n;
void rec(int l,int r){
    //cout<<l<<" "<<r<<endl;
    if(l == r){
        arr[l] = counter;
        counter++;
        if(counter>maxsz){
            counter--;
        }
        return;
    }
    cout<<(r-l+1)<<" ";
    for(int i=l;i<=r;i++){
        cout<<i<<" ";
    }
    
    cout<<endl;
    cout.flush();
    int sz;
    cin>>sz;
    if(l == 1 && r == n){
        maxsz = sz;
    }
    if(sz == (r-l+1)){
        
        for(int i=l;i<=r;i++){
            arr[i] = counter;
            counter++;
            if(counter>maxsz){
                counter--;
            }
        }
        return;
    }
    if(sz == 1){
        for(int i=l;i<=r;i++){
            arr[i] = counter;
            
        }
        counter++;
        if(counter>maxsz){
            counter--;
        }
        return;
    }
    int mid = (l+r)/2;
    rec(l,mid);
    rec(mid+1,r);
}
int main(){
  
    cin>>n;
 
    cout.flush();

    rec(1,n);
    cout<<0<<" ";
    for(int i=1;i<=n;i++){
        cout<<arr[i]<<" ";
    }
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Incorrect 2 ms 384 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Incorrect
2 Halted 0 ms 0 KB -