Submission #485566

#TimeUsernameProblemLanguageResultExecution timeMemory
485566dxz05Finding Routers (IOI20_routers)C++14
70.13 / 100
2 ms296 KiB
#include "routers.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_routers(int len, int n, int q){
    vector<int> p(n);

    for (int i = 1; i < n; i++){
        int l = p[i - 1] + 1, r = len - 1;
        while (l <= r) {
            int m = (l + r) >> 1;
            if (use_detector(m) == i - 1){
                l = m + 1;
            } else r = m - 1;
        }

        l--;
        p[i] = 2 * l - p[i - 1];

    }

    return p;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...