Submission #921934

#TimeUsernameProblemLanguageResultExecution timeMemory
921934AiperiiiCave (IOI13_cave)C++14
13 / 100
9 ms560 KiB
#include <bits/stdc++.h>
#include "cave.h"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;

void exploreCave(int N) {
   int q[N],g[N];
   for(int i=0;i<N;i++){
      q[i]=0;
   }
   for(int i=0;i<N;i++){
      q[i]=1;
      int res=tryCombination(q);
      g[i]=res;
      q[i]=0;
   }
   answer(q,g);
}
#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...