| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1249997 | Aliyyiakbar | 선물 (IOI25_souvenirs) | C++20 | 11 ms | 412 KiB |
#include "bits/stdc++.h"
#include "souvenirs.h"
using namespace std;
void buy_souvenirs(int n, long long p0)
{
int cnt = 0, curr = p0 - 1;
for (int i = 1; i < n; ++i)
{
auto x = transaction(curr);
if ((int)x.first.size() > 1)
{
++cnt;
curr -= 1 + x.second;
for (int j = 0; j < i - 1; ++j)
{
transaction(curr);
}
--curr;
}
else
{
curr -= x.second;
if (i == n - 1)
{
for (int j = 0; j < i - 1 - cnt; ++j)
{
transaction(curr);
}
}
else
{
for (int j = 0; j < i - 1; ++j)
{
transaction(curr);
}
}
}
--curr;
}
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... | ||||
