Submission #727939

#TimeUsernameProblemLanguageResultExecution timeMemory
727939Elvin_FritlCave (IOI13_cave)C++17
12 / 100
9 ms340 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int v[n]; memset(v,0,sizeof(v)); int res[n]; for(int i=0;i<n;i++){ res[i]=i; } while(true){ int k = tryCombination(v); if(k == -1) break; v[k] ^= 1; } answer(v,res); }
#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...