Submission #727945

#TimeUsernameProblemLanguageResultExecution timeMemory
727945Elvin_FritlCave (IOI13_cave)C++17
25 / 100
11 ms424 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]; if(tryCombination(v) == -1){ for(int i = 0; i < n; i++){ v[i] = 1; res[i] = tryCombination(v); v[i] = 0; } } else{ 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...