| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1364366 | mannshah1211 | Souvenirs (IOI25_souvenirs) | C++20 | 9 ms | 412 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
void buy_souvenirs(int n, long long p0) {
long long curp = p0;
vector<int> queried(n);
for (int i = 1; i < n; i++) {
pair<vector<int>, long long> x = transaction(curp - 1);
for (int y : x.first) {
++queried[y];
}
if (x.first.size() == 1) {
if (x.second == 0) {
curp = curp - 1;
} else {
curp = curp - 2;
}
} else {
curp = curp - 2;
}
for (int j = 0; j < i - queried[i]; j++) {
transaction(curp);
}
}
return;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
