# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1226276 | _rain_ | Sparklers (JOI17_sparklers) | C++20 | 1 ms | 1352 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=(int)1000;
const long double eps=1e-17;
int x[N+2];
int n,t,k;
bool add(int l,int r,int length,LL s){
return (long double)(x[r]-x[l])/(double)2/(double)s<=(long double)length*t;
}
bool f[N+2][N+2];
bool possible(LL s){
memset(f,0,sizeof f);
f[k][k]=true;
for(int length=1;length<=n;++length){
for(int i=1;i<=n;++i){
int j=i+length-1;
if (j>n) break;
if (f[i][j]){
if (i-1>=1 && add(i-1,j,j-i+1,s)) f[i-1][j]=true;
if (j+1<=n && add(i,j+1,j-i+1,s)) f[i][j+1]=true;
}
}
}
return f[1][n];
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0) ; cout.tie(0);
#define task "main"
if (fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin>>n>>k>>t;
for(int i=1;i<=n;++i) cin>>x[i];
int low=1,high=(int)1e9,ans=-1;
while (low<=high){
int mid=(low+high)/2;
if (possible(mid)){
ans=mid;
high=mid-1;
}
else low=mid+1;
}
cout<<ans;
return 0;
}
컴파일 시 표준 에러 (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... |