# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969219 | 2024-04-24T16:59:59 Z | Fyx | Cave (IOI13_cave) | C++14 | 0 ms | 0 KB |
#include "cave.h" void echeckploreCave(int N) { int a[N]; int b[N]; for (int i = 0; i < N; i++)a[i] = 0; for (int i = 0; i < N; i++)b[i] = -1; int check; for (int i = 0; i < N; i++) { check = tryCombltion(a); if (check == i) { for (int j = 0; j < N; j++) if (b[j] == -1) a[j] ^= 1; } int l = 0, r = N - 1, ans = N - 1; while (l <= r) { int m = (l + r) >> 1; for (int j = 0; j <= m; j++) if (b[j] == -1) a[j] ^= 1; check = tryCombltion(a); for (int j = 0; j <= m; j++)if (b[j] == -1) a[j] ^= 1; if (check == i) { ans = m; r = m - 1; } else { l = m + 1; } } b[ans] = i; } answer(a, b); }