Submission #1081678

#TimeUsernameProblemLanguageResultExecution timeMemory
1081678nikdA Light Inconvenience (CEOI23_light)C++17
0 / 100
317 ms344 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll n; void prepare(){ n = 1; } pair<long long, vector<long long>> join(long long p){ n+=p; vector<ll> sol; ll temp = 2; while(n-temp+2>0){ sol.push_back(n-temp+2); temp<<=1; } if(sol[sol.size()-1]!=1){ sol.push_back(1); } reverse(sol.begin(), sol.end()); return {p, sol}; } pair<long long, vector<long long>> leave(long long p){ n-=p; vector<ll> sol; ll temp = 2; while(n-temp+2>0){ sol.push_back(n-temp+2); temp<<=1; } if(sol[sol.size()-1]!=1){ sol.push_back(1); } reverse(sol.begin(), sol.end()); return {p, sol}; }
#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...