#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> query_cache;
int customQuery(int x) {
if (query_cache[x] >= 0) {
return query_cache[x];
}
int result = use_detector(x);
query_cache[x] = result;
return result;
}
std::vector<int> find_routers(int length, int n, int _q) {
vector<int> answers(n);
// go to closest (lower_eq) even number
int global_upper = length & (~1);
query_cache.assign(length + 1, -1);
// for numbers up to x, y is the upper limit
// until index, stricter upper
set<pair<int, int>> upper_cache;
for (int i = 1; i < n; i++)
{
// find router i
int minimum = answers[i - 1];
// even, exclusive
int lower = minimum;
// even, inclusive
int upper = global_upper;
auto it = upper_cache.lower_bound({upper, 0});
if (it != upper_cache.end()) {
upper = (*it).second;
}
while (lower + 2 < upper) {
int middle = (lower + upper) / 2;
if (middle % 2 == 1) {
middle --;
}
int test = minimum + (middle - minimum) / 2 + 1;
int result = customQuery(test);
if (result < i) {
// the number is > middle
lower = middle;
} else {
// the number is <= middle
upper = middle;
if (result > i) {
// I know additional information
upper_cache.insert({result, upper});
// maybe todo remove some from upper_cache as well?
}
}
}
answers[i] = lower + 2;
}
return answers;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
Output is correct |
| 2 |
Correct |
1 ms |
596 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Correct |
1 ms |
596 KB |
Output is correct |
| 5 |
Correct |
1 ms |
596 KB |
Output is correct |
| 6 |
Correct |
1 ms |
596 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
1 ms |
688 KB |
Output is correct |
| 9 |
Correct |
0 ms |
596 KB |
Output is correct |
| 10 |
Correct |
1 ms |
596 KB |
Output is correct |
| 11 |
Correct |
1 ms |
596 KB |
Output is correct |
| 12 |
Correct |
1 ms |
684 KB |
Output is correct |
| 13 |
Correct |
1 ms |
596 KB |
Output is correct |
| 14 |
Correct |
1 ms |
596 KB |
Output is correct |
| 15 |
Correct |
1 ms |
596 KB |
Output is correct |
| 16 |
Correct |
1 ms |
596 KB |
Output is correct |
| 17 |
Correct |
1 ms |
596 KB |
Output is correct |
| 18 |
Correct |
1 ms |
596 KB |
Output is correct |
| 19 |
Correct |
1 ms |
596 KB |
Output is correct |
| 20 |
Correct |
1 ms |
596 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
Output is correct |
| 2 |
Correct |
1 ms |
596 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Correct |
1 ms |
596 KB |
Output is correct |
| 5 |
Correct |
1 ms |
596 KB |
Output is correct |
| 6 |
Correct |
1 ms |
680 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
1 ms |
596 KB |
Output is correct |
| 9 |
Correct |
1 ms |
596 KB |
Output is correct |
| 10 |
Correct |
1 ms |
596 KB |
Output is correct |
| 11 |
Correct |
1 ms |
724 KB |
Output is correct |
| 12 |
Correct |
1 ms |
596 KB |
Output is correct |
| 13 |
Correct |
1 ms |
596 KB |
Output is correct |
| 14 |
Correct |
1 ms |
596 KB |
Output is correct |
| 15 |
Correct |
1 ms |
596 KB |
Output is correct |
| 16 |
Correct |
1 ms |
596 KB |
Output is correct |
| 17 |
Correct |
1 ms |
596 KB |
Output is correct |
| 18 |
Correct |
1 ms |
596 KB |
Output is correct |
| 19 |
Correct |
1 ms |
596 KB |
Output is correct |
| 20 |
Correct |
1 ms |
596 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
Output is correct |
| 2 |
Correct |
1 ms |
684 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Correct |
1 ms |
684 KB |
Output is correct |
| 5 |
Correct |
1 ms |
596 KB |
Output is correct |
| 6 |
Correct |
1 ms |
596 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
1 ms |
596 KB |
Output is correct |
| 9 |
Correct |
1 ms |
684 KB |
Output is correct |
| 10 |
Correct |
1 ms |
596 KB |
Output is correct |
| 11 |
Correct |
1 ms |
680 KB |
Output is correct |
| 12 |
Correct |
1 ms |
680 KB |
Output is correct |
| 13 |
Correct |
1 ms |
596 KB |
Output is correct |
| 14 |
Correct |
1 ms |
596 KB |
Output is correct |
| 15 |
Correct |
1 ms |
596 KB |
Output is correct |
| 16 |
Correct |
1 ms |
684 KB |
Output is correct |
| 17 |
Correct |
1 ms |
596 KB |
Output is correct |
| 18 |
Correct |
1 ms |
596 KB |
Output is correct |
| 19 |
Correct |
1 ms |
596 KB |
Output is correct |
| 20 |
Correct |
1 ms |
596 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
3 ms |
980 KB |
Partial score |
| 2 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 3 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 4 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 5 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 6 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 7 |
Partially correct |
3 ms |
908 KB |
Partial score |
| 8 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 9 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 10 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 11 |
Correct |
3 ms |
1236 KB |
Output is correct |
| 12 |
Partially correct |
4 ms |
980 KB |
Partial score |
| 13 |
Correct |
2 ms |
980 KB |
Output is correct |
| 14 |
Partially correct |
3 ms |
980 KB |
Partial score |
| 15 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 16 |
Partially correct |
3 ms |
980 KB |
Partial score |
| 17 |
Partially correct |
2 ms |
944 KB |
Partial score |
| 18 |
Partially correct |
3 ms |
980 KB |
Partial score |
| 19 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 20 |
Partially correct |
3 ms |
980 KB |
Partial score |
| 21 |
Partially correct |
2 ms |
980 KB |
Partial score |
