제출 #1162225

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

routers

#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pii pair<int,int>
#define pl pair<ll,ll>
#define F first
#define S second
#define pq priority_queue
#define all(x) x.begin(), x.end()
#define deb(x) cout << #x << " = " << x << '\n';
#define deb2(x,y) cout << #x << " = " << x << ", " << #y << " = " << y << '\n';


int bs(int last, int poc, int kon){		//szuka najwiekszego gdzie use detector zwraca last
	while(kon > poc){
		int mid = (poc+kon)/2;

		//deb(mid);
		int ok = use_detector(mid);
		if(ok == last) poc = mid;
		else if(ok < last) poc = mid+1;
		else kon = mid-1;

		//deb2(poc, kon);
	}
	return poc;
}

vector<int> find_routers(int l, int n, int q) {
    vector<int> ans(n);
    for(int i = 1; i < n; i++){
    	int coc = bs(i-1, (ans[i-1]+1),l)-ans[i-1];
		ans[i] = ans[i-1]+2*coc;
	}
	return ans;
}

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