# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
391180 |
2021-04-18T07:06:18 Z |
palilo |
Taxis (POI13_tak) |
C++17 |
|
134 ms |
4172 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;
vector<int64_t> a(n);
for (auto& x : a) cin >> x;
sort(a.begin(), a.end(), greater<int64_t>());
int64_t last_taxi;
if (auto it = upper_bound(a.begin(), a.end(), m - d, greater<int64_t>()); it == a.begin())
return cout << 0, 0;
else {
last_taxi = *prev(it);
if (last_taxi >= m + d) return cout << 1, 0;
a.erase(prev(it));
}
int64_t mid = m - last_taxi;
// mid에 도착하면 한 번에 골인 가능
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 >= mid) 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 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
204 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 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
716 KB |
Output is correct |
2 |
Correct |
3 ms |
588 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
844 KB |
Output is correct |
2 |
Incorrect |
15 ms |
844 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
1228 KB |
Output is correct |
2 |
Incorrect |
54 ms |
1944 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
71 ms |
2636 KB |
Output is correct |
2 |
Incorrect |
99 ms |
2892 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
133 ms |
4172 KB |
Output is correct |
2 |
Incorrect |
103 ms |
3404 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
98 ms |
4172 KB |
Output is correct |
2 |
Incorrect |
134 ms |
4172 KB |
Output isn't correct |