제출 #1242304

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242304		hiikunZ	Finding Routers (IOI20_routers)	C++20	100 / 100	1 ms	328 KiB

routers

#include "routers.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
std::vector<int> find_routers(int L,int N,int Q) {
    vector<int> ret(N,-1);
    ret[0] = 0;
    vector<ll> ans = {0};
    ll T;

    while((ll)ans.size() < N){
        T = max((ll)((L - ret[ans.back()]) / (N - (ll)ans.size()) * 0.3),1LL);
        ll l = ret[ans.back()] + 1,r = min((ll)L,l + T),k = -1;
        while(1){
            ll res = use_detector(r);
            if(res == ans.back()){
                l = r;
                r = min((ll)L,r + T);
            }
            else{
                k = res;
                break;
            }
        }
        while(r - l > 1){
            ll m = (l + r) / 2;
            ll res = -1;
            if(m == ret[ans.back()] + 1) res = ans.back();
            else res = use_detector(m);
            if(res == ans.back()) l = m;
            else{
                r = m;
                k = res;
            }
        }
        ll dis = l - ret[ans.back()];
        ans.emplace_back(k);
        // cerr << k << " " << l + dis << endl;
        ret[k] = l + dis;
    }
    return ret;
}

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