제출 #1122900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122900		omsincoconut	A Light Inconvenience (CEOI23_light)	C++17	5 / 100	228 ms	416 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);

    for (ll i = 1; cz-i+1 > 1; i *= 2) newcur.push_back(cz-i+1);

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

    vector<ll> actual;

    ll t = 5*p;
    for (ll i : newcur) {
        ll gap = i - *(upper_bound(cur.begin(), cur.end(), i) - 1);
        if (gap <= t) actual.push_back(i);
    }

    cur = actual;

    return make_pair(t, cur);
}

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

    vector<ll> newcur;
    newcur.push_back(1);

    for (ll i = 1; cz-i+1 > 1; i *= 2) newcur.push_back(cz-i+1);

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

    vector<ll> actual;

    ll t = 5*p;
    for (ll i : newcur) {
        ll gap = i - *(upper_bound(cur.begin(), cur.end(), i) - 1);
        if (gap <= t) actual.push_back(i);
    }

    cur = actual;

    return make_pair(t, cur);
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 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