oj.uz

Submission #356784

# Submission time Handle Problem Language Result Execution time Memory
356784 2021-01-23T16:49:43 Z YJU Sparklers (JOI17_sparklers) C++14
50 / 100
 196 ms 65004 KB 
#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<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e3+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,JOI,t,dp[N][N],x[N],u[N];

bool ck(ll k){
	memset(dp,0,sizeof(dp));
	REP1(i,n)x[i]=u[i]-2*k*t*i;
	dp[JOI][JOI]=1;
	for(int L=1;L<=n;L++){
		for(int i=1;i+L-1<=n;i++){
			if(i+L<=n&&x[i]>=x[i+L])dp[i][i+L]|=dp[i][i+L-1];
			if(i-1>=1&&x[i-1]>=x[i+L-1])dp[i-1][i+L-1]|=dp[i][i+L-1];
		}
	}
	return dp[1][n];
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>JOI>>t;
	REP1(i,n)cin>>u[i];
	ll l=-1,r=1e9+10;
	while(r-l>1){
		ll mid=(l+r)>>1;
		if(ck(mid)){
			r=mid;
		}else{
			l=mid;
		}
	}
	cout<<r<<"\n";
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 31980 KB Output is correct
2 Correct 129 ms 31980 KB Output is correct
3 Correct 134 ms 31980 KB Output is correct
4 Correct 131 ms 31852 KB Output is correct
5 Correct 130 ms 31868 KB Output is correct
6 Correct 133 ms 31980 KB Output is correct
7 Correct 134 ms 31852 KB Output is correct
8 Correct 136 ms 31852 KB Output is correct
9 Correct 132 ms 31980 KB Output is correct
10 Correct 131 ms 31852 KB Output is correct
11 Correct 130 ms 31852 KB Output is correct
12 Correct 133 ms 31980 KB Output is correct
13 Correct 132 ms 31980 KB Output is correct
14 Correct 131 ms 31852 KB Output is correct
15 Correct 133 ms 31852 KB Output is correct
16 Correct 130 ms 31852 KB Output is correct
17 Correct 132 ms 31980 KB Output is correct
18 Correct 133 ms 31980 KB Output is correct
19 Correct 129 ms 31852 KB Output is correct
20 Correct 130 ms 31980 KB Output is correct
21 Correct 127 ms 31980 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 31980 KB Output is correct
2 Correct 129 ms 31980 KB Output is correct
3 Correct 134 ms 31980 KB Output is correct
4 Correct 131 ms 31852 KB Output is correct
5 Correct 130 ms 31868 KB Output is correct
6 Correct 133 ms 31980 KB Output is correct
7 Correct 134 ms 31852 KB Output is correct
8 Correct 136 ms 31852 KB Output is correct
9 Correct 132 ms 31980 KB Output is correct
10 Correct 131 ms 31852 KB Output is correct
11 Correct 130 ms 31852 KB Output is correct
12 Correct 133 ms 31980 KB Output is correct
13 Correct 132 ms 31980 KB Output is correct
14 Correct 131 ms 31852 KB Output is correct
15 Correct 133 ms 31852 KB Output is correct
16 Correct 130 ms 31852 KB Output is correct
17 Correct 132 ms 31980 KB Output is correct
18 Correct 133 ms 31980 KB Output is correct
19 Correct 129 ms 31852 KB Output is correct
20 Correct 130 ms 31980 KB Output is correct
21 Correct 127 ms 31980 KB Output is correct
22 Correct 154 ms 31852 KB Output is correct
23 Correct 144 ms 31980 KB Output is correct
24 Correct 152 ms 31980 KB Output is correct
25 Correct 177 ms 31852 KB Output is correct
26 Correct 169 ms 31852 KB Output is correct
27 Correct 182 ms 32020 KB Output is correct
28 Correct 180 ms 31900 KB Output is correct
29 Correct 176 ms 31900 KB Output is correct
30 Correct 171 ms 31852 KB Output is correct
31 Correct 171 ms 31980 KB Output is correct
32 Correct 175 ms 31852 KB Output is correct
33 Correct 174 ms 31980 KB Output is correct
34 Correct 195 ms 31928 KB Output is correct
35 Correct 174 ms 31852 KB Output is correct
36 Correct 172 ms 31852 KB Output is correct
37 Correct 188 ms 31980 KB Output is correct
38 Correct 179 ms 31852 KB Output is correct
39 Correct 196 ms 31852 KB Output is correct
40 Correct 180 ms 31852 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 31980 KB Output is correct
2 Correct 129 ms 31980 KB Output is correct
3 Correct 134 ms 31980 KB Output is correct
4 Correct 131 ms 31852 KB Output is correct
5 Correct 130 ms 31868 KB Output is correct
6 Correct 133 ms 31980 KB Output is correct
7 Correct 134 ms 31852 KB Output is correct
8 Correct 136 ms 31852 KB Output is correct
9 Correct 132 ms 31980 KB Output is correct
10 Correct 131 ms 31852 KB Output is correct
11 Correct 130 ms 31852 KB Output is correct
12 Correct 133 ms 31980 KB Output is correct
13 Correct 132 ms 31980 KB Output is correct
14 Correct 131 ms 31852 KB Output is correct
15 Correct 133 ms 31852 KB Output is correct
16 Correct 130 ms 31852 KB Output is correct
17 Correct 132 ms 31980 KB Output is correct
18 Correct 133 ms 31980 KB Output is correct
19 Correct 129 ms 31852 KB Output is correct
20 Correct 130 ms 31980 KB Output is correct
21 Correct 127 ms 31980 KB Output is correct
22 Correct 154 ms 31852 KB Output is correct
23 Correct 144 ms 31980 KB Output is correct
24 Correct 152 ms 31980 KB Output is correct
25 Correct 177 ms 31852 KB Output is correct
26 Correct 169 ms 31852 KB Output is correct
27 Correct 182 ms 32020 KB Output is correct
28 Correct 180 ms 31900 KB Output is correct
29 Correct 176 ms 31900 KB Output is correct
30 Correct 171 ms 31852 KB Output is correct
31 Correct 171 ms 31980 KB Output is correct
32 Correct 175 ms 31852 KB Output is correct
33 Correct 174 ms 31980 KB Output is correct
34 Correct 195 ms 31928 KB Output is correct
35 Correct 174 ms 31852 KB Output is correct
36 Correct 172 ms 31852 KB Output is correct
37 Correct 188 ms 31980 KB Output is correct
38 Correct 179 ms 31852 KB Output is correct
39 Correct 196 ms 31852 KB Output is correct
40 Correct 180 ms 31852 KB Output is correct
41 Runtime error 70 ms 65004 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -