| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1312751 | cansu_mutlu | A Light Inconvenience (CEOI23_light) | C++20 | 373 ms | 420 KiB |
#include<bits/stdc++.h>
#include "light.h"
using namespace std;
void prepare()
{
}
set< long long> a = {1};
long long insan = 1;
std::pair<long long, std::vector<long long>> join( long long val)
{
long long cur;
long long res = val;
insan+= val;
long long i=1;
cur = insan;
a.clear();
while(i<cur)
{
a.insert(i);
i*=2;
}
a.insert(cur);
i = 1;
while(cur-i>=1)
{
a.insert(cur-i);
i*=2;
}
vector< long long> b;
for( long long x:a) b.push_back(x);
return {res,b};
}
std::pair<long long, std::vector<long long>> leave( long long val)
{
insan -=val;
long long cur = *prev(a.upper_bound(insan));
long long res = val;
cur = insan;
long long i=1;
a.clear();
while(i<cur)
{
a.insert(i);
i*=2;
}
a.insert(cur);
i = 1;
while(cur-i>=1)
{
a.insert(cur-i);
i*=2;
}
vector< long long> b;
for( long long x:a) b.push_back(x);
return {res,b};
}
| # | 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... | ||||
