| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1273890 | lorenzoferrari | 선물 (IOI25_souvenirs) | C++20 | 1 ms | 332 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <cassert>
using namespace std;
using LL = long long;
#define F first
#define S second
void buy_souvenirs(int n, LL p0) {
// case n == 3
auto [s, r] = transaction(p0 - 1);
if ((int)s.size() == 1) {
transaction(p0 - 1 - r - 1);
transaction(p0 - 1 - r - 1);
} else {
transaction((p0 - 1 - r) / 2);
}
}
| # | 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... | ||||
