제출 #1230206

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

routers

#include "routers.h"
#include <vector>
#include <cassert>
#include <cstdio>
#include <algorithm>
using namespace std;

std::vector<int> find_routers(int le, int n, int q) {
    vector<int>ans(n);
    ans[0]=0;
    vector<int>lol(n);
    for(int i=0;i<=n-1;i++){
    	int l=(i==0?0:ans[i-1]+1);
    	int r=le;
    	int an=-1;
    	while(l<=r){
    		int mid=(l+r)/2;
    		int nw=use_detector(mid);
    		if(nw>i) r=mid-1;
    		else {
    			an=mid;
    			l=mid+1;
			}
		}
		lol[i]=an;
		if(i>0) ans[i]=(lol[i]+lol[i-1])/2;
	}
	return ans;
}

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