| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1344721 | ElayV13 | Souvenirs (IOI25_souvenirs) | C++20 | 8 ms | 344 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void buy_souvenirs(int N,long long P0)
{
vector<int>cost(N,-1);
vector<int>cnt(N,0);
cost[0]=P0;
for(int i=1;i<N;i++){
int fi=cost[i-1]-1;
int si=cost[i-1]-2;
if(si==0){
cost[i]=fi;
continue;
}
if(i==N-1){
if(transaction(fi).first[0]==i){
cost[i]=fi;
cnt[i]++;
break;
}
}
if(transaction(si).first[0]==i){
cost[i]=si;
cnt[i]++;
}
else{
cost[i]=fi;
cnt[i+1]++;
}
}
for(int i=0;i<N;i++){
while(cnt[i]!=i){
++cnt[i];
transaction(cost[i]);
}
}
cout<<endl;
}
| # | 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... | ||||
