Submission #1206927

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206927		trimkus	A Light Inconvenience (CEOI23_light)	C++20	100 / 100	182 ms	436 KiB

light

#include "light.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int cnt;
ll N = 1;
const ll alpha = 1;
vector<ll> active = {1};
void prepare(){
	cnt = 0;
}

void complete(ll p) {
	vector<ll> nw = {N};
	ll x = N;
	// cout << x << " -> ";
	while (x > 1) {
		x -= min(x - 1, N + 1 - (x - 1));
		int i = upper_bound(begin(active), end(active), x) - begin(active) - 1;
		if (x - active[i] > p) {
			x = active[i + 1];
		}
		// cout << x << " -> ";
		nw.push_back(x);
	}
	// cout << " end!\n";
	nw.push_back(1);
	active = nw;
}

std::pair<long long, std::vector<long long>> join(long long p){
	ll T = alpha * p;
	N += p;
	complete(T);
	sort(begin(active), end(active));
	active.erase(unique(begin(active), end(active)), end(active));
	return {T, active};
}

std::pair<long long, std::vector<long long>> leave(long long p){
	ll T = alpha * p;
	N -= p;
	complete(T);
	sort(begin(active), end(active));
	active.erase(unique(begin(active), end(active)), end(active));
	return {T, active};
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 5 / 5
• Subtask 7: 60 / 60