# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991460 | 2024-06-02T09:36:55 Z | sleepntsheep | September (APIO24_september) | C++17 | 0 ms | 0 KB |
int what = 2; if (N >= 2001) what = 1; for (i = 0; i < what; ++i) { for (j = 0; j < N - 1; ++j) { int u = S[i][j]; Put(u, ta.query(tin[u], tout[u])); } }