Submission #383240

#TimeUsernameProblemLanguageResultExecution timeMemory
383240nicholaskCave (IOI13_cave)C++14
12 / 100
27 ms492 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N){ int s[N]; for (int i=0; i<N; i++) s[i]=0; for (int i=0; i<N; i++){ if (tryCombination(s)==i){ if (s[i]==0) s[i]=1; else s[i]=0; } } int d[N]; for (int i=0; i<N; i++) d[i]=i; answer(s,d); }
#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...