Submission #207762

#TimeUsernameProblemLanguageResultExecution timeMemory
207762a_playerCave (IOI13_cave)C++14
12 / 100
28 ms512 KiB
#include "cave.h"
#include <bits/stdc++.h>
#define try tryCombination

using namespace std;

const int MAXN = 5e3+5;
int S[MAXN];
int D[MAXN];
void exploreCave(int N) {
   iota(D,D+N,0);
   for(int i=0;i<N;i++){
       int t=try(S);
       if(t==-1){
           answer(S,D);
           return;
       }else if(t==i)S[i]=1;
   }
   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...