Submission #559544

#TimeUsernameProblemLanguageResultExecution timeMemory
559544ahmet34Finding Routers (IOI20_routers)C++14
72.85 / 100
2 ms340 KiB
#include <bits/stdc++.h>
#include "routers.h"
using namespace std;
 
using ll = long long;
using pii = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

const int INF = 2e9, N = 2e5+15, M = 998244353, LOG = 16;
const ll LINF = 1e18;


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

	for(int i = 1; i < n; i++) 
	{
		int s = ans.back()+1, e = l;
		
		while(s < e) {
			int m = (s + e + 1) / 2;
			if(use_detector(m) > i-1) e = m-1;
			else s = m;
			q--;
		}
		ans.push_back(ans.back() + 2 * (s - ans.back()));
	}
	assert(q >= 0);
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...