Submission #917041

#TimeUsernameProblemLanguageResultExecution timeMemory
917041manishjha91Cave (IOI13_cave)C++17
12 / 100
8 ms520 KiB
#include "cave.h" #include <bits/stdc++.h> void exploreCave(int N) { int a[N]; memset(a,0,sizeof a); int d[N]; for(int i=0; i<N; i++) d[i] = i; int i=tryCombination(a); while(i!=-1) { a[i] ^=1; i = tryCombination(a); } answer(a,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...