Submission #1250536

#TimeUsernameProblemLanguageResultExecution timeMemory
1250536tranvinhhuy2010Souvenirs (IOI25_souvenirs)C++20
25 / 100
12 ms420 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int n, cnt[105]; ll p[105]; ll adu_calculate(ll s, int k) { s += k*(k-1)/2; return s/k; } void adu_build(ll money) { auto [a, remain] = transaction(money); int k = a.size(); ll sum = money - remain; for (int i : a) cnt[i]++; if (k>1) { ll x = adu_calculate(sum, k); adu_build(x-1); } while (a.size()>1) { sum -= p[a.back()]; a.pop_back(); } if (!a.empty()) { p[a[0]] = sum; if (a[0]+1<n && p[a[0]+1]==0) adu_build(p[a[0]]-1); } } void adu_complete() { for (int i=1; i<n; i++) { while (cnt[i]<i) { transaction(p[i]); cnt[i]++; } } } void buy_souvenirs(int N, ll P0) { n = N; p[0] = P0; adu_build(P0-1); adu_complete(); }
#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...