제출 #1082104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082104		GrindMachine	Finding Routers (IOI20_routers)	C++17	100 / 100	1 ms	600 KiB

routers

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int B = 127;

#include "routers.h"

std::vector<int> find_routers(int l, int n, int q) {
	vector<int> ans(n);
	
	auto f = [&](int i, int lo, int hi){
		int pos = lo-1;

		while(lo <= hi){
			int mid = (lo+hi)>>1;
			if(use_detector(mid) == i){
				pos = mid;
				lo = mid+1;
			}
			else{
				hi = mid-1;
			}
		}

		int d = pos-ans[i];
		ans[i+1] = ans[i]+2*d;
	};

	if(n == 2){
		f(0,0,l);
		return ans;
	}

	int prev_last = 0;

	for(int x = 0; x <= l; x += B){
		int r = min(x+B-1,l);
		int p = use_detector(r);
		if(p == prev_last) conts;
		for(int j = prev_last; j < p; ++j){
			int lo = max(ans[j],x), hi = r;
			f(j,lo,hi);
		}
		prev_last = p;
	}

	assert(prev_last == n-1);

	return ans;

	// rep(i,n-1){
	// 	f(i,ans[i],l);
	// }

    // int idx = use_detector(0);
    // std::vector<int> ans;
    // for (int i = 0; i < n; i++) {
	// 	ans.push_back(0);
	// }
	// return ans;
}

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