제출 #300647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300647		rocks03	Finding Routers (IOI20_routers)	C++14	98.10 / 100	2 ms	512 KiB

routers

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int) (x).size())
using namespace std;


int use_detector(int x);

vector<int> find_routers(int l, int n, int q){
    vector<int> ans(n);
    vector<int> maxpos(n, l);
    ans[0] = 0;
    int last = 0;
    for(int i = 1; i < n; i++){
        int l = last + 1, r = maxpos[i];
        while(r - l > 1){
            int m = (l + r) / 2;
            int index = use_detector(m);
            maxpos[index] = min(m, maxpos[index]);
            if(index != i-1)
                r = m;
            else
                l = m;
        }
        ans[i] = 2 * ((r - 1) - last) + last;
        last = ans[i];
    }
    return ans;
}

• Subtask 1: 16 / 16
• Subtask 2: 21 / 21
• Subtask 3: 23 / 23
• Subtask 4: 38.102399999999996 / 40