Submission #1178719

#TimeUsernameProblemLanguageResultExecution timeMemory
1178719alexddA Light Inconvenience (CEOI23_light)C++20
0 / 100
378 ms416 KiB
#include<bits/stdc++.h> #include "light.h" using namespace std; #define int long long int n; void prepare() { n=1; } vector<long long> calc() { set<int> s; for(int i=0;(1LL<<i)<=n;i++) { s.insert(n - (1LL<<i) + 1); s.insert((1LL<<i)); } s.insert(1); s.insert(n); vector<int> aux; for(auto it:s) aux.push_back(it); return aux; } pair<long long, vector<long long>> join(long long p) { n += p; return {p, calc()}; } pair<long long, vector<long long>> leave(long long p) { n -= p; return {p, calc()}; } /** 4 3 -2 2 3 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...