This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int use_detector(int x);
vector < int > find_routers(int l, int n, int q) {
vector < int > p(n);
p[0] = 0;
vector < int > aux(n, 0);
for (int i = 1; i <= l; ++i) {
aux[use_detector(i)]++;
}
for (int i = 1; i < n; ++i) {
p[i] = p[i - 1] + 2 * aux[i - 1];
aux[i] -= aux[i - 1];
}
return p;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |