| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1345747 | orgiloogii | Souvenirs (IOI25_souvenirs) | C++20 | 10 ms | 360 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
void buy_souvenirs(int n, long long p) {
long long curr = p - 1;
int ls = 0;
for (int i = 1;i < n - 1;i++) {
pair<vector<int>, long long> res = transaction(curr);
if (res.first.size() == 2) {
ls++;
curr--;
}
for (int j = 1;j < i;j++) {
pair<vector<int>, long long> temp = transaction(curr);
}
curr--;
}
while (ls < n - 1) {
transaction(curr);
ls++;
}
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... | ||||
