Submission #1036687

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036687		model_code	A Light Inconvenience (CEOI23_light)	C++17	100 / 100	390 ms	852 KiB

light

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

ll N = 1;
vector<ll> act = {1};

void prepare() {
}

pair<ll, vector<ll>> solve(ll p) {
  vector<ll> ret = {N};
  ll x = N;
  while (x > 1) {
    x -= min(x - 1, N - x + 2);
    int i = upper_bound(act.begin(), act.end(), x) - act.begin() - 1;
    if (x - act[i] > p)
      x = act[i + 1];
    ret.insert(ret.begin(), x);
  }
  swap(ret, act);
  return {p, act};
}

pair<ll, vector<ll>> join(ll p) {
  N += p;
  return solve(p);
}

pair<ll, vector<ll>> leave(ll p) {
  N -= p;
  return solve(p);
}

• 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