# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300188 | model_code | Finding Routers (IOI20_routers) | 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.
public class routers {
int[] ans, dist;
int ctr = 0;
void bs(int s, int e, int a, int b) {
if (a > b) return;
if (e - s == b - a) {
for (int i = s; i <= e; i++) {
dist[ctr++] = i;
}
return;
}
if (s + 1 == e) {
if (grader.use_detector(e) == a) {
dist[ctr++] = e;
} else {
dist[ctr++] = s;
}
return;
}
int m = (s + e) / 2;
int hi = grader.use_detector(m);
bs(s, m - 1, a, hi - 1);
bs(m, e, hi, b);
}
int[] find_routers(int l, int n, int q) {
ctr = 0;
dist = new int[n];
bs(0, l, 0, n - 2);
ans = new int[n];
ans[0] = 0;
for (int i = 1; i < n; i++) {
ans[i] = 2 * dist[i - 1] - ans[i - 1];
}
return ans;
}
}