# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991460 | sleepntsheep | September (APIO24_september) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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]));
}
}