제출 #1230118

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

routers

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

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

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