Submission #1141023

#TimeUsernameProblemLanguageResultExecution timeMemory
1141023AliyyiakbarCave (IOI13_cave)C++20
34 / 100
28 ms516 KiB
#include "cave.h" #include "bits/stdc++.h" using namespace std; void exploreCave(int n) { int s[n], d[n]; memset(s, 0, sizeof(s)); int query = tryCombination(s); while(query != -1) { for (int i = 0; i < n; ++i) { s[i] = !s[i]; int currQuery = tryCombination(s); if (currQuery == -1 || currQuery > query) { query = currQuery; break; } s[i] = !s[i]; } } // assert(tryCombination(s) == -1); for (int i = 0; i < n; ++i) { s[i] = !s[i]; int pos = tryCombination(s); d[i] = pos; s[i] = !s[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...