# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232929 | thebes | Sparklers (JOI17_sparklers) | C++14 | 5 ms | 512 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<double,double> pdd;
typedef vector<int> vi;
#define F first
#define S second
#define pb push_back
const int MN = 1005;
int N, K, T, i, j, lo, hi, mid, arr[MN];
long double a[MN]; pii opt;
int main(){
scanf("%d%d%d",&N,&K,&T);
for(i=1;i<=N;i++)
scanf("%d",&arr[i]);
if(arr[N]==0){
printf("0\n");
return 0;
}
lo = 1, hi = 1e9;
while(lo<hi){
mid = (lo+hi)>>1;
opt={K,K};
a[K]=arr[K]-(long double)2*mid*K*T;
for(i=1;i<=N;i++){
a[i]=(long double)arr[i]-(long double)2*mid*i*T;
if(i<K&&a[i]>a[opt.F]) opt.F=i;
if(i>K&&a[i]<a[opt.S]) opt.S=i;
}
int l=K, r=K, mx, fl = 0, c;
while(1){
mx = r; c = r;
while(r+1<=opt.S&&a[r+1]<=a[l]){
mx=(a[mx]>=a[r+1])?r+1:mx;
r++;
}
r = c;
if(mx>r){
r = mx;
continue;
}
mx = l; c = l;
while(l-1>=opt.F&&a[r]<=a[l-1]){
mx=(a[mx]<=a[l-1])?l-1:mx;
l--;
}
l = c;
if(mx<l){
l = mx;
continue;
}
break;
}
if(l!=opt.F||r!=opt.S) fl=1;
l=1, r=N;
while(1){
mx = r; c = r;
while(r-1>=opt.S&&a[r-1]<=a[l]){
mx=(a[mx]>=a[r-1])?r-1:mx;
r--;
}
r = c;
if(mx<r){
r = mx;
continue;
}
mx = l; c = l;
while(l+1<=opt.F&&a[r]<=a[l+1]){
mx=(a[mx]<=a[l+1])?l+1:mx;
l++;
}
l = c;
if(mx>l){
l = mx;
continue;
}
break;
}
if(l!=opt.F||r!=opt.S) fl=1;
if(a[1]<a[N]) fl=1;
if(fl) lo=mid+1;
else hi=mid;
}
printf("%d\n",lo);
return 0;
}
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... |