이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |