제출 #1082055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082055		nikd	A Light Inconvenience (CEOI23_light)	C++17	100 / 100	478 ms	820 KiB

light

#include <bits/stdc++.h>
#define ll long long
using namespace std;

vector<ll> f;
ll n;

void prepare(){
    n =1;
    f ={1};
}

pair<long long, vector<long long>> join(long long p){
    n+=p;
    vector<ll> sol = {n};
    ll temp = n;
    while(temp>1){
        temp -= min(temp-1, n-temp+2);
        ll i = upper_bound(f.begin(), f.end(), temp)-f.begin()-1;
        if(temp-f[i]>p){
            temp = f[i+1];
        }
        sol.insert(sol.begin(), temp);
    }
    swap(sol, f);
    return {p, f};
}
pair<long long, vector<long long>> leave(long long p){
    n-=p;
    vector<ll> sol = {n};
    ll temp = n;
    while(temp>1){
        temp -= min(temp-1, n-temp+2);
        ll i = upper_bound(f.begin(), f.end(), temp)-f.begin()-1;
        if(temp-f[i]>p){
            temp = f[i+1];
        }
        sol.insert(sol.begin(), temp);
    }
    swap(sol, f);
    return {p, f};
}

• 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