제출 #1182932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182932		abdalrhman_sfar	A Light Inconvenience (CEOI23_light)	C++20	100 / 100	160 ms	436 KiB

light

#include "light.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define int long long

vector<int> v;

void prepare(){
    v.emplace_back(1);
}

pair<long long, vector<long long>> join(long long p){
    int n=v.back()+p;
    vector<int> ans; ans.emplace_back(n);
    int i=v.size()-1,c=n;
    while (c>1) {
        int a=(c-1)-(n-c+1);
        if (c<=v[i]) {--i; continue;}
        else if (a<=v[i]) {
            if (i==0) {
                ans.emplace_back(v[i]);
                c=v[i]; continue;
            }
            else {
                if (a<=v[i-1]) {--i; continue;}
                else if (a<=(v[i-1]+p)) {--i; continue;}
                else {
                    ans.emplace_back(v[i]);
                    c=v[i]; continue;
                }
            }
        }
        else {
            ans.emplace_back(a);
            c=a; continue;
        }
    } sort(ans.begin(),ans.end()); unique(ans.begin(),ans.end());
    v.clear(); v=ans;
    return {p,ans};
}

pair<long long, vector<long long>> leave(long long p){
    //for (auto&it:v) cout << it << ' '; cout << '\n';
	int n=v.back()-p;
    vector<int> ans; ans.emplace_back(n);
    int i=v.size()-1,c=n;
    while (c>1) {
        int a=(c-1)-(n-c+1);
        if (c<=v[i]) {--i; continue;}
        else if (a<=v[i]) {
            if (i==0) {
                ans.emplace_back(v[i]);
                c=v[i]; continue;
            }
            else {
                if (a<=v[i-1]) {--i; continue;}
                else if (a<=(v[i-1]+p)) {--i; continue;}
                else {
                    ans.emplace_back(v[i]);
                    c=v[i]; continue;
                }
            }
        }
        else {
            ans.emplace_back(a);
            c=a; continue;
        }
    } sort(ans.begin(),ans.end()); unique(ans.begin(),ans.end());
    v.clear(); v=ans;
    return {p,ans};
}

• 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