oj.uz

Submission #314652

# Submission time Handle Problem Language Result Execution time Memory
314652 2020-10-20T14:51:53 Z jaaguptamme Cave (IOI13_cave) C++14
0 / 100
 571 ms 460 KB 
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void SW(int in[],int dn[],int ps){
    for(int i=0;i<ps;i++){
        if(dn[i]==0){
            in[i]=1-in[i];
        }
    }
}
/*int tryCombination(int in[]){
    for(int i=0;i<sizeof in;i++){
        cout<<in[i]<<' ';
    }
    cout<<endl;
    int vl;cin>>vl;
    return vl;
}*/
void exploreCave(int N){
    int in[N],ns[N],dn[N];
    for(int i=0;i<N;i++)in[i]=ns[i]=dn[i]=0;
    for(int i=0;i<N;i++){
        int cur=tryCombination(in);
        if(cur>=i+1){
            int l=0,r=N-1,ans=N;
            while(l<=r){
                int m=(l+r)/2;
                SW(in,dn,m);
                if(tryCombination(in)<i+1){
                    ans=m;
                     r=m-1;
                }else{
                    l=m+1;
                }
                SW(in,dn,m);
            }
            ans--;
            dn[ans]=1;
            ns[i]=ans;
            //cout<<ans<<endl;
        }else{
            int l=0,r=N-1,ans=N;
            while(l<=r){
                int m=(l+r)/2;
                SW(in,dn,m);
                if(tryCombination(in)>=i+1){
                    ans=m;
                    r=m-1;
                }else{

                    l=m+1;
                }
                SW(in,dn,m);
            }
            ans--;
            dn[ans]=1;
            ns[i]=ans;
            in[ans]=1;
            //cout<<ans<<endl;
        }
    }
    /*for(int i=0;i<N;i++){
        cout<<in[i]<<' ';
    }
    cout<<endl;
    for(int i=0;i<N;i++){
        cout<<ns[i]<<' ';
    }
    cout<<endl;*/
    answer(in,ns);
}
/*
int main(){
    exploreCave(4);
}
*/

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 308 ms 460 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 571 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 308 ms 460 KB Answer is wrong
2 Halted 0 ms 0 KB -