| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1316763 | ezzzay | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
void buy_souvenirs(int N, long long P0) {
vector<ll>prices;
prices.pb(P0);
int cnt=0;
for(int i=1;i<N;i++){
std::pair<std::vector<int>, long long> p = transaction(P0-1);
if(p.ff.size()==2){
cnt++;
prices.pb(P0-2);
P0-=2;
break;
}
else if(p.ss==0){
P0--;
}
else{
P0-=2;
}
for(int j=1;j<i;j++) {
transaction(p0);
}
}
for(int i=cnt;i<N-1;i++) {
transaction(P0-1);
}
}
