Submission #1034394

#TimeUsernameProblemLanguageResultExecution timeMemory
1034394tvladm2009Sparklers (JOI17_sparklers)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 5; ll n, k, t; ll x[N]; bool check2(__int128 v) { int l = k; int r = k; for (int i = 0; i < n; i++) { while (r < n && x[r + 1] - x[l] <= 2 * v * (r - l + 1) * t) r++; while (l > 1 && x[r] - x[l - 1] <= 2 * v * (r - l + 1) * t) l--; } return l == 1 && r == n; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k >> t; for (int i = 1; i <= n; ++i) cin >> x[i]; ll l = 0, r = 1e9, sol = -1; while (l <= r) { ll m = (l + r) / 2; if (check2(m)) { sol = m; r = m - 1; } else { l = m + 1; } } cout << sol << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...