Submission #984597

#TimeUsernameProblemLanguageResultExecution timeMemory
984597SzymonKrzywdaCave (IOI13_cave)C++17
0 / 100
2035 ms348 KiB
#include"cave.h" #include <bits/stdc++.h> using namespace std; int tryCombination(int S[]); void answer(int S[],int D[]); void exploreCave(int N){ int S[N]; //int S_2[N]; int D[N]; int w = 0; while (w != -1){ w = tryCombination(S); if (w!=-1){ for (int i=w; w<N; i++){ S[i] = (S[i]+1)%2; } } } for (int i=0; i<N; i++){ S[i] = (S[i]+1)%2; D[i] = tryCombination(S); S[i] = (S[i]+1)%2; } 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...