#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int low, int upp, int val) {
while (low < upp) {
int mid = (low + upp + 1) / 2;
int qres = use_detector(mid);
// cerr << mid << endl;
if (qres >= val) upp = mid - 1;
else low = mid;
}
return low;
}
vector<int> find_routers(int l, int n, int q) {
vector<int> ans;
ans.push_back(0);
if (n == 2) {
int res = solve(0, l, 1);
ans.push_back(res * 2);
return ans;
}
vector<pair<int, int>> close;
close.push_back({0, 0});
constexpr int jump = 160;
for (int i = jump; i < l; i += jump) close.push_back({use_detector(i), i});
close.push_back({use_detector(l), l});
for (int i = 1; i < n; ++i) {
auto upp = lower_bound(close.begin(), close.end(), make_pair(i, 0));
auto low = prev(upp);
int res = solve(low->second, upp->second, i);
ans.push_back(2 * res - ans.back());
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
356 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
600 KB |
Output is correct |
| 7 |
Correct |
0 ms |
600 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
600 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
600 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
1 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 2 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 3 |
Partially correct |
1 ms |
344 KB |
Partial score |
| 4 |
Partially correct |
1 ms |
344 KB |
Partial score |
| 5 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 6 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 7 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 8 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 9 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 10 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 11 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 12 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 13 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 14 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 15 |
Partially correct |
1 ms |
600 KB |
Partial score |
| 16 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 17 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 18 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 19 |
Partially correct |
1 ms |
344 KB |
Partial score |
| 20 |
Partially correct |
1 ms |
348 KB |
Partial score |
| 21 |
Partially correct |
1 ms |
348 KB |
Partial score |
