| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338629 | khanhphucscratch | Souvenirs (IOI25_souvenirs) | C++20 | 12 ms | 412 KiB |
#include "souvenirs.h"
#include<bits/stdc++.h>
using namespace std;
void buy_souvenirs(int n, long long P0) {
//Subtask 3
for(int i = 1; i < n; i++){
if(i == n-1){
for(int j = 1; j <= i; j++) transaction(P0 - 1);
}
else{
pair<vector<int>, int> a = transaction(P0 - 2);
vector<int> vec = a.first;
if(vec[0] == i){
for(int j = 1; j <= i-1; j++) transaction(P0 - 2);
P0 -= 2; continue;
}
else{
for(int j = 1; j <= i; j++) transaction(P0 - 1);
for(int j = 1; j <= i; j++) transaction(P0 - 2);
P0 -= 2; 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... | ||||
