| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1260478 | JvThunder | Souvenirs (IOI25_souvenirs) | C++20 | 12 ms | 412 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
void buy_souvenirs(int N, long long P0) {
long long prv = P0;
int ones_time = 0;
pair<vector<int>, long long> res;
for(int i = 1; i < N-1; i++) {
res = transaction(prv-1);
long long curr;
if(res.first.size() == 2) {
ones_time++;
curr = prv-2;
} else {
curr = prv-1-res.second;
}
for(int j = 0; j < i-1; j++) res = transaction(curr);
prv = curr;
}
for(int i = 0; i < N-ones_time-1; i++) res = transaction(prv-1);
}
| # | 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... | ||||
