# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763799 | 2023-06-22T21:33:29 Z | MilosMilutinovic | Measures (CEOI22_measures) | C++14 | 1500 ms | 1124 KB |
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10; int n, m, d, a[N], b[N]; bool check(long double x) { long double prv = a[1] - x; for (int i = 2; i <= n; i++) { long double L = a[i] - x; long double R = a[i] + x; long double pos = max(L, prv + d); if (pos > R) { return false; } prv = pos; } return true; } int main() { scanf("%d%d%d", &n, &m, &d); for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); } for (int i = 1; i <= m; i++) { scanf("%d", &b[i]); } for (int i = 1; i <= m; i++) { a[++n] = b[i]; sort(a + 1, a + n + 1); //long long low = 0, high = 1e17, ans = 1e17; /* while (low <= high) { long long mid = low + (high - low) / 2; if (check(mid)) { ans = mid; high = mid - 1; } else { low = mid + 1; } } */ long long ans = 0; for (int l = 1; l <= n; l++) for (int r = l + 1; r <= n; r++) ans = max(ans, ((r - l) * 1ll * d - (a[r] - a[l]))); if (ans & 1) printf("%lld.5 ", ans / 2); else printf("%lld ", ans / 2); /*if (ans > 0 && check(ans - 0.5)) printf("%lld.5 ", ans - 1); else printf("%lld ", ans);*/ } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 212 KB | Output is correct |
2 | Correct | 19 ms | 324 KB | Output is correct |
3 | Correct | 19 ms | 324 KB | Output is correct |
4 | Correct | 20 ms | 212 KB | Output is correct |
5 | Correct | 19 ms | 212 KB | Output is correct |
6 | Correct | 20 ms | 212 KB | Output is correct |
7 | Correct | 20 ms | 324 KB | Output is correct |
8 | Correct | 19 ms | 320 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 212 KB | Output is correct |
2 | Correct | 19 ms | 324 KB | Output is correct |
3 | Correct | 19 ms | 324 KB | Output is correct |
4 | Correct | 20 ms | 212 KB | Output is correct |
5 | Correct | 19 ms | 212 KB | Output is correct |
6 | Correct | 20 ms | 212 KB | Output is correct |
7 | Correct | 20 ms | 324 KB | Output is correct |
8 | Correct | 19 ms | 320 KB | Output is correct |
9 | Execution timed out | 1551 ms | 1056 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1563 ms | 1124 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1563 ms | 1124 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |