# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063262 | beaconmc | Brought Down the Grading Server? (CEOI23_balance) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "light.h"
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
ll n, maxi;
vector<ll> prevs;
void prepare(){
n = 1;
maxi = n;
prevs = {1};
}
pair<long long, std::vector<long long>> join(long long p){
n += p;
set<ll> stuff;
stuff.insert(1);
stuff.insert(n);
for (auto&i : prevs){
if (i != 1) stuff.insert(i+p);
}
vector<ll> real;
for (auto&i : stuff) if (1<=i && i<=n) real.push_back(i);