Submission #228748

#TimeUsernameProblemLanguageResultExecution timeMemory
228748jhtanCave (IOI13_cave)C++14
13 / 100
17 ms512 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int S[N]; int D[N]; // 12 points /*for(int i=0; i<N; i++) { S[i] = 0; D[i] = i; } for(int i=0; i<N; i++) { int x = tryCombination(S); if(x == -1) break; if(x == i) S[i] = 1; } answer(S, D);*/ memset(S, 0, sizeof(S)); for(int i=0; i<N; i++) { S[i] = 1; D[i] = tryCombination(S); S[i] = 0; } 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...