| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1260598 | robijoy | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 400 KiB |
/*
* Starting with the name of almighty ALLAH
*/
#include "souvenirs.h"
using namespace std;
void buy_souvenirs(int N, long long P0) {
pair<vector<int>,long long> res = transaction(P0-1);
vector<int> robi = res.first;
int ret = res.second;
if(robi.size() == 1) {
int P1 = (P0 - 1) - ret;
transaction(P1-1);
transaction(P1-1);
} else {
int x = max(1LL,((((P0-1)-ret)/2)));
pair<vector<int>,long long> rex = transaction(x);
}
}
| # | 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... | ||||
