| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345324 | Jer | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 344 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void buy_souvenirs(int n, long long p0)
{
if (n == 3)
{
pair<vector<int>, ll> res = transaction(p0 - 1);
if (res.first.size() == 1)
{
for (int i = 0; i < 2; i++)
transaction(p0 - res.second - 2);
return;
}
ll sum = (p0 - 1 - res.second);
transaction(sum / 2);
return;
}
pair<vector<int>, ll> res = transaction(p0 - 1);
ll sum = p0 - 1 - res.second, rem;
for (int i = 1; i < n - 1; i++)
rem = transaction(sum / 2).second, sum = (sum / 2) - rem;
return;
}
| # | 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... | ||||
