Submission #921927

#TimeUsernameProblemLanguageResultExecution timeMemory
921927AiperiiiCave (IOI13_cave)C++14
12 / 100
16 ms504 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]=1; } for(int i=0;i<N;i++){ g[i]=i; } for(int i=0;i<N;i++){ int res=tryCombination(q); if(res>=i+1 or res==-1)continue; 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...