Submission #1060617

#TimeUsernameProblemLanguageResultExecution timeMemory
1060617YassineBenYounesA Light Inconvenience (CEOI23_light)C++17
0 / 100
331 ms344 KiB
#include <bits/stdc++.h> using namespace std; #include "light.h" #define ll long long #define fi first #define se second #define pb push_back vector<ll> cur; long long n=1; void prepare(){ cur.pb(1); } std::pair<long long, std::vector<long long>> join(long long p){ cur.clear(); n+=p; long long i=1; while(n-i+1>1){ cur.pb(n-i+1); i*=2; } cur.pb(1); sort(cur.begin(),cur.end()); return {p , cur}; } std::pair<long long, std::vector<long long>> leave(long long p){ cur.clear(); n-=p; ll i=1; while(n-i+1>1){ cur.pb(n-i+1); i*=2; } cur.pb(1); sort(cur.begin(),cur.end()); return {p, cur}; }
#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...