# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
581759 | 2022-06-23T05:52:43 Z | 반딧불(#8365) | Sparklers (JOI17_sparklers) | C++17 | 1 ms | 212 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int n, k; ll t; ll arr[100002]; bool able(ll speed){ speed*=t*2; int l = 1, r = n; for(int cnt=n-1; cnt>=1; cnt--){ if(arr[r]-arr[l] > speed*cnt) return false; if(arr[r] - arr[r-1] > arr[l+1] - arr[l]) r--; else l++; } return true; } int main(){ scanf("%d %d %lld", &n, &k, &t); for(int i=1; i<=n; i++) scanf("%lld", &arr[i]); arr[0] = -1e18, arr[n+1] = 1e18; if(arr[1] == arr[n]){ puts("0"); return 0; } ll L = 1, R = 1e9, ANS = 1e9; while(L<=R){ ll MID = (L+R)/2; if(able(MID)) ANS = MID, R = MID-1; else L = MID+1; } printf("%lld", ANS); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |