Submission #1258951

#TimeUsernameProblemLanguageResultExecution timeMemory
1258951dattenlamjSouvenirs (IOI25_souvenirs)C++20
18 / 100
0 ms412 KiB
#include<bits/stdc++.h> #define ll long long std::pair<std::vector<int>, ll> transaction(ll M) ; void buy_souvenirs(int n, ll P0){ auto [v,x] = transaction(P0-1); ll a[n]; for (int i=0;i<n;i++){ a[i]=0; } a[0]=P0; if (v.size()==1){ a[1]=P0-1-x; transaction(a[1]-1); transaction(a[1]-1); } else{ ll y=P0-x-1; transaction((y/2)); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...