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