Submission #1310733

#TimeUsernameProblemLanguageResultExecution timeMemory
1310733nataliaaCave (IOI13_cave)C++20
0 / 100
182 ms496 KiB
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int v[N]={};
    int a[N] ={};
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < i; j++) {
            if(a[j]==1) a[j] = 0;
            else a[j] = 1;
        }
        int k = tryCombination(a);
        if(k==-1) break;
        if(k!=i) a[i] = 1;
        for(int j = 0; j < i; j++) {
            if(a[j]==1) a[j] = 0;
            else a[j] = 1;
        }
    }
    for(int i = 0; i < N; i++) {
        int l = 0, r= N-1;
        while(l<=r) {
            int m = (l+r)/2;
            for(int j = 0; j <= m; j++) {
                if(a[i]==1) a[i]=0;
                else a[i]=1;
            }
            int k = tryCombination(a);
            for(int j = 0; j <= m; j++) {
                if(a[i]==1) a[i]=0;
                else a[i]=1;
            }
            if(k >= i||k==-1) r = m-1;
            else l=m+1;
        }
        v[i] =l;
    }
     answer( a,v);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...