제출 #1202559

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

routers

#include <bits/stdc++.h>
#include "routers.h"
using namespace std;

vector<int> find_routers(int l, int n, int q){
    vector<int> ans(n, 0);

    if (n == 2){
        int lo = 0, hi = l + 1;
        while (hi - lo > 1){
            int mid = lo + (hi - lo) / 2;
            if (use_detector(mid) == 0)
                lo = mid;
            else
                hi = mid;
        }
        ans[1] = 2 * lo;
        return ans;
    }

    for (int i = 1; i < n; i ++){
        int last = ans[i - 1], cur = 128;
        while (last + cur <= l and use_detector(last + cur) == i - 1)
            cur += 128;

        int lo = last + cur - 128, hi = min(l + 1, last + cur);
        while (hi - lo > 1){
            int mid = (lo + hi) / 2;
            if (use_detector(mid) == i - 1)
                lo = mid;
            else
                hi = mid;
        }
        ans[i] = 2 * lo - last;
    }
	return ans;
}

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