| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1341563 | adriines06 | A Light Inconvenience (CEOI23_light) | C++20 | 136 ms | 420 KiB |
#include "light.h"
#include <vector>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int cnt;
ll a=1;
bool l=0;
void prepare(){
}
std::pair<long long, std::vector<long long>> join(long long p){
a+=p;
ll b=1;
vector<ll>v;
if(l){
v={a};
return {p, v};
}
while(1){
if(b>a) break;
v.push_back(a-(b-1));
b*=2;
}
if(v[v.size()-1]!=1) v.push_back(1);
sort(v.begin(),v.end());
return{p,v};
}
std::pair<long long, std::vector<long long>> leave(long long p){
a-=p;
vector<ll>v={1,a};
if(a==1) v={1};
l=1;
return {p, v};
}
| # | 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... | ||||
