| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1253130 | hectormedrano | 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 x = P0;
int t = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j < i; j++) {transaction(x);}
pair<vector<int>, long long> res = transaction(x - 1);
vector<int> v = res.first;
long long c = res.second + 1;
if (v.size() == 1) {
x -= c;
} else {
t++;
x -= 2;
}
}
for (int i = t;i < N - 2;i++) { transaction(x);}
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... | ||||
