| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1359626 | raineyj | Souvenirs (IOI25_souvenirs) | C++20 | 8 ms | 344 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);
else if(N==3)
{
pair<vector<int>, long long> res=transaction(P0-1);
if(res.first.size()==1)
{
transaction(P0-1-res.second-1);
transaction(P0-1-res.second-1);
}
else
{
long long c=P0-1-res.second;
res=transaction(c/2);
}
}
else if(P0==N)
{
for(int i=1; i<N; i++)
{
for(int j=0; j<i; j++) transaction(N-i);
}
}
}| # | 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... | ||||
