# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320559 | arnold518 | Sparklers (JOI17_sparklers) | C++14 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 100000;
const ll INF = 1e18;
int N, K;
ll T, A[MAXN+10], B[MAXN+10];
bool decide(ll X)
{
X*=2;
if(T*X>(ll)1e9) return true;
for(int i=1; i<=N; i++) B[i]=A[i]-i*T*X;
int l=K, r=K;
ll lv=B[l], rv=B[r];
while(!(l==0 && r==N+1))
{
int bl=l, br=r;
lv=-INF;
for(; l>=1 && B[l]>=rv; l--) lv=max(lv, B[l]);
rv=INF;
for(; r<=N && B[r]<=lv; r++) rv=min(rv, B[r]);
if(l==bl && r==br) return false;
}
return true;
}
int main()
{
scanf("%d%d%lld", &N, &K, &T);
for(int i=1; i<=N; i++) scanf("%lld", &A[i]);
ll lo=-1, hi=1e9+10;
while(lo+1<hi)
{
ll mid=lo+hi>>1;
if(decide(mid)) hi=mid;
else lo=mid;
}
printf("%lld\n", hi);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |