Submission #719089

#TimeUsernameProblemLanguageResultExecution timeMemory
719089TahirAliyevCave (IOI13_cave)C++17
12 / 100
9 ms412 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n){ int comb[n]; memset(comb, 0, sizeof(comb)); int doors[n]; for (int i = 0; i < n; i++) { doors[i] = i; } while(true){ int d = tryCombination(comb); if(d == -1) break; comb[d] ^= 1; } answer(comb, doors); }
#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...