| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1250837 | JoksimKaktus | Souvenirs (IOI25_souvenirs) | C++20 | 11 ms | 412 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
void buy_souvenirs(int N, long long p) {
int bet = p-1;
int repeat = 1;
int one = 0;
for(int i = N-1;i > 1;i--){
for(int j = 0;j < repeat;j++){
if(j == 0){
pair<vector<int>,long long> k = transaction(bet);
if(k.first.size() == 2){
one++;
bet--;
}else if(k.second == 1){
bet--;
}
}else{
transaction(bet);
}
}
bet--;
repeat++;
}
while(one < N-1){
one++;
transaction(bet);
}
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... | ||||
