| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1249835 | vahagng | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 412 KiB |
#include "bits/stdc++.h"
#include "souvenirs.h"
using namespace std;
void buy_souvenirs(int N, long long P0) {
N=N;
auto t = transaction(P0 - 1);
long long P2 = (P0 - 1 - t.second) / (int)t.first.size();
P2 -= (t.first.size() == 1);
transaction(P2);
if(t.first.size() == 1)
transaction(P2);
}| # | 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... | ||||
