Submission #456255

#TimeUsernameProblemLanguageResultExecution timeMemory
456255osmanallazovCave (IOI13_cave)C++14
13 / 100
19 ms380 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std; 
void exploreCave(int N) {
    int s[N],d[N];
    memset(s, 0, sizeof s); 
    if(tryCombination(s)==-1) {
        for(int i=0;i<N;i++) {
            s[i]=1; 
            d[i]=tryCombination(s); 
            s[i]=0; 
        } answer(s,d); 
    }
    for(int i=0;i<N;i++) {
        int x=tryCombination(s); 
        if(x==1)
          break; 
        if(x<=i)
          s[i]^=1; 
    }
    for(int i=0;i<N;i++) 
        d[i]=i; 
    answer(s,d); 
}
#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...