Submission #1122890

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122890		omsincoconut	A Light Inconvenience (CEOI23_light)	C++17	0 / 100	79 ms	48592 KiB

light

#include "light.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

vector<ll> cur;

void prepare() {
    cur = {1};
}

pair<ll, vector<ll>> join(ll p) {
    ll cz = cur.back() + p;

    vector<ll> newcur;
    newcur.push_back(1);
    ll sm = 0;
    for (ll i = 1; sm < cz; i++) {
        newcur.push_back(cz-sm);
        sm += i;
    }

    sort(newcur.begin(), newcur.end());
    newcur.resize(unique(newcur.begin(), newcur.end()) - newcur.begin());

    ll t = 0;
    for (ll i : newcur) {
        t = max(t, i - *(upper_bound(cur.begin(), cur.end(), i) - 1));
    }

    cur = newcur;

    return make_pair(t, cur);
}

pair<ll, vector<ll>> leave(ll p){
    ll cz = cur.back() - p;

    vector<ll> newcur;
    newcur.push_back(1);
    ll sm = 0;
    for (ll i = 1; sm < cz; i++) {
        newcur.push_back(cz-sm);
        sm += i;
    }

    sort(newcur.begin(), newcur.end());
    newcur.resize(unique(newcur.begin(), newcur.end()) - newcur.begin());

    ll t = 0;
    for (ll i : newcur) {
        t = max(t, i - *(upper_bound(cur.begin(), cur.end(), i) - 1));
    }

    cur = newcur;

    return make_pair(t, cur);
}

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