Submission #727935

#TimeUsernameProblemLanguageResultExecution timeMemory
727935Elvin_FritlCave (IOI13_cave)C++17
0 / 100
6 ms352 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++){ int k=tryCombination(v); if(k<=i){ v[i]=(v[i]+1)%2; } res[i]=i; } 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...