# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29448 | 2017-07-19T11:31:47 Z | kdh9949 | Taxis (POI13_tak) | C++14 | 183 ms | 5924 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int n, t; ll d, b, x, a[500010]; int main(){ scanf("%lld%lld%d", &d, &b, &n); for(int i = 0; i < n; i++) scanf("%lld", a + i); sort(a, a + n, greater<int>()); t = int(upper_bound(a, a + n, d - b, greater<int>()) - a - 1); int cnt = 0; for(int i = 0; i < n; i++){ if(a[i] >= b + d - 2 * x){ printf("%d\n", cnt + 1); return 0; } if(i == t) continue; x += max(0LL, a[i] - (b - x)); x = min(x, b); cnt++; if(a[t] >= b + d - 2 * x){ printf("%d\n", cnt + 1); return 0; } } puts("0"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Correct | 0 ms | 5924 KB | Output is correct |
3 | Correct | 0 ms | 5924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Correct | 0 ms | 5924 KB | Output is correct |
3 | Correct | 0 ms | 5924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Correct | 0 ms | 5924 KB | Output is correct |
3 | Correct | 0 ms | 5924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Correct | 0 ms | 5924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 5924 KB | Output is correct |
2 | Correct | 3 ms | 5924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 5924 KB | Output is correct |
2 | Correct | 23 ms | 5924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 5924 KB | Output is correct |
2 | Incorrect | 66 ms | 5924 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 133 ms | 5924 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 183 ms | 5924 KB | Output is correct |
2 | Incorrect | 136 ms | 5924 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 163 ms | 5924 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |