Submission #768756

#TimeUsernameProblemLanguageResultExecution timeMemory
768756raysh07Taxis (POI13_tak)C++17
0 / 100
93 ms4180 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define INF (int)1e18 #define f first #define s second mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count()); void Solve() { int m, d, n; cin >> m >> d >> n; vector <int> a(n); for (auto &x : a) cin >> x; sort(a.begin(), a.end(), greater<int>()); int curr = 0; int ans = 0; for (auto x : a){ x -= abs(d - curr); if (x < 0) { continue; } curr += x; ans++; if (curr >= m) break; } if (curr < m) { cout << 0 << "\n"; return; } pair<int, int> mn = {INF, -1}; for (int i = 0; i < n; i++){ if (a[i] >= m - d){ mn = min(mn, {a[i], i}); } } int got = mn.second; int cnt = 0; curr = 0; for (int i = 0; i < n; i++){ if (i == got) continue; a[i] -= abs(d - curr); if (a[i] < 0) continue; curr += a[i]; cnt++; if (curr >= d) break; } cout << min(ans, cnt + 1) << "\n"; } int32_t main() { auto begin = std::chrono::high_resolution_clock::now(); ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; // cin >> t; for(int i = 1; i <= t; i++) { //cout << "Case #" << i << ": "; Solve(); } auto end = std::chrono::high_resolution_clock::now(); auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin); cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...