# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70082 | 2018-08-22T10:23:11 Z | octopuses | popa (BOI18_popa) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> //#include "popa.h" #pragma GCC optimize("O3") using namespace std; int solve(int n, int* lt, int* rt) { int root = 0; lt[0] = -1; rt[n - 1] = 1; for(int i = 1; i < n; ++ i) if(query(i - 1, i, i - 1, i - 1)) { rt[i - 1] = i; lt[i] = -1; } else { lt[i] = root; rt[i - 1] = -1; root = i; } }