제출 #127181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127181		Utaha	Sparklers (JOI17_sparklers)	C++14	50 / 100	51 ms	1528 KiB

sparklers

/*input
3 2 10
0
200
300
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
	out<<'('<<P.F<<','<<P.S<<')';
	return out;
}

//}}}
const ll maxn=1005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;

ll mypow(ll a,ll b){
	ll res=1LL;
	while(b){
		if(b&1) res=res*a%MOD;
		a=a*a%MOD;
		
		b>>=1;
	}
	return res;
}
ll n,k,t;
ll a[maxn];

bool dp[maxn][maxn];

int main(){
	IOS;
	cin>>n>>k>>t;
	k--;
	REP(i,n) cin>>a[i];

	ll l=-1,r=1000000000LL;

	while(l!=r-1){
		ll mid=(l+r)/2;

		dp[k][k]=1;
		for(int len=1;len<n;len++){
			for(int i=0;i+len<n;i++){
				if(a[i+len]-a[i]<=len*t*2*mid&&(dp[i][i+len-1]||dp[i+1][i+len])){
					dp[i][i+len]=1;
				}
				else dp[i][i+len]=0;
			}
		}
		// cout<<mid<<'\n';
		// REP(i,n) REP(j,n) cout<<dp[i][j]<<" \n"[j==n-1];
		if(dp[0][n-1]==1) r=mid;
		else l=mid;
	}
	cout<<r<<'\n';
	return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 20 / 20
• Subtask 3: 0 / 50