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