Submission #1284338

#TimeUsernameProblemLanguageResultExecution timeMemory
1284338AbdullahIshfaqA Light Inconvenience (CEOI23_light)C++20
0 / 100
148 ms412 KiB
#include "light.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 998244353

ll N = 1;
const ll alpha = 1;
vector<ll> fire = {1};

void prepare(){
}
void ch(ll p) {
	vector<ll> tmp = {N};
	ll x = N;
	while (x > 1) {
		x -= min(x - 1, N - (x - 1));
		tmp.push_back(x);
	}
	tmp.push_back(1);
	fire = tmp;
}

pair<ll, vector<ll>> join(ll p){
	N += p;
	ch(p);
	sort(fire.begin(), fire.end());
	fire.resize(unique(fire.begin(), fire.end()) - fire.begin());
	return {p, fire};
}

pair<ll, vector<ll>> leave(ll p){
	N -= p;
	ch(p);
	sort(fire.begin(), fire.end());
	fire.resize(unique(fire.begin(), fire.end()) - fire.begin());
	return {p, fire};
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...