# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
391168 |
2021-04-18T06:40:34 Z |
palilo |
Taxis (POI13_tak) |
C++17 |
|
138 ms |
13508 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
#ifdef home
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
int64_t m, d;
int n;
cin >> m >> d >> n;
// -----------(d)---------------> m
// n texis
vector<int64_t> a(n);
for (auto& x : a) cin >> x;
sort(a.begin(), a.end(), greater<int64_t>());
if (auto it = upper_bound(a.begin(), a.end(), m - d, greater<int64_t>()); it == a.begin())
return cout << 0, 0;
else
a.erase(prev(it));
int64_t pos = 0;
int ans = 0;
for (const auto& x : a) {
if (x < d - pos) return cout << 0, 0;
pos += x - (d - pos);
++ans;
if (pos >= d) break;
}
cout << ans + (pos < m);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
320 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
1096 KB |
Output is correct |
2 |
Correct |
4 ms |
588 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
1484 KB |
Output is correct |
2 |
Incorrect |
18 ms |
1612 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
2436 KB |
Output is correct |
2 |
Incorrect |
58 ms |
5196 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
74 ms |
6884 KB |
Output is correct |
2 |
Incorrect |
90 ms |
8644 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
138 ms |
13444 KB |
Output is correct |
2 |
Incorrect |
112 ms |
10344 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
102 ms |
13508 KB |
Output is correct |
2 |
Incorrect |
135 ms |
12940 KB |
Output isn't correct |