Submission #560125

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
560125	2022-05-11T05:33:14 Z	amunduzbaev	Sparklers (JOI17_sparklers)	C++17	50 / 100	226 ms	262144 KB

sparklers

#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long

const int inf = 1e9 + 5;

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, k, t; cin>>n>>k>>t;
	
	vector<int> a(n), d(n);
	for(int i=0;i<n;i++) cin>>a[i], a[i] *= 2;
	for(int i=1;i<n;i++){
		d[i] = a[i] - a[i-1];
	}
	k--;
	
	auto check = [&](int s){
		vector<int> b(n);
		for(int i=0;i<n;i++) b[i] = a[i] / 2 - i * s * t;
		vector<vector<int>> dp(n, vector<int>(n, 0));
		dp[k][k] = 1;
		for(int len=0;len<n;len++){
			for(int i=0;i+len<n;i++){
				int j=i+len;
				if(j+1<n && b[i] >= b[j+1]){
					dp[i][j+1] |= dp[i][j];
				} if(i && b[i-1] >= b[j]){
					dp[i-1][j] |= dp[i][j];
				}
			}
		}
		
		return dp[0][n-1];
	};
	
	int l = 0, r = 2 * inf;
	while(l < r){
		int m = (l + r) >> 1;
		if(check(m)) r = m;
		else l = m + 1;
	}
	
	cout<<(l+1) / 2<<"\n";
}

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	316 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	316 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	109 ms	4676 KB	Output is correct
23	Correct	58 ms	2912 KB	Output is correct
24	Correct	96 ms	4772 KB	Output is correct
25	Correct	182 ms	8300 KB	Output is correct
26	Correct	155 ms	8260 KB	Output is correct
27	Correct	189 ms	8292 KB	Output is correct
28	Correct	194 ms	8516 KB	Output is correct
29	Correct	184 ms	8284 KB	Output is correct
30	Correct	203 ms	8288 KB	Output is correct
31	Correct	185 ms	8292 KB	Output is correct
32	Correct	163 ms	8320 KB	Output is correct
33	Correct	188 ms	8492 KB	Output is correct
34	Correct	203 ms	8288 KB	Output is correct
35	Correct	165 ms	8392 KB	Output is correct
36	Correct	180 ms	8276 KB	Output is correct
37	Correct	212 ms	8284 KB	Output is correct
38	Correct	188 ms	8320 KB	Output is correct
39	Correct	189 ms	8252 KB	Output is correct
40	Correct	226 ms	8400 KB	Output is correct

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	316 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	109 ms	4676 KB	Output is correct
23	Correct	58 ms	2912 KB	Output is correct
24	Correct	96 ms	4772 KB	Output is correct
25	Correct	182 ms	8300 KB	Output is correct
26	Correct	155 ms	8260 KB	Output is correct
27	Correct	189 ms	8292 KB	Output is correct
28	Correct	194 ms	8516 KB	Output is correct
29	Correct	184 ms	8284 KB	Output is correct
30	Correct	203 ms	8288 KB	Output is correct
31	Correct	185 ms	8292 KB	Output is correct
32	Correct	163 ms	8320 KB	Output is correct
33	Correct	188 ms	8492 KB	Output is correct
34	Correct	203 ms	8288 KB	Output is correct
35	Correct	165 ms	8392 KB	Output is correct
36	Correct	180 ms	8276 KB	Output is correct
37	Correct	212 ms	8284 KB	Output is correct
38	Correct	188 ms	8320 KB	Output is correct
39	Correct	189 ms	8252 KB	Output is correct
40	Correct	226 ms	8400 KB	Output is correct
41	Runtime error	116 ms	262144 KB	Execution killed with signal 9
42	Halted	0 ms	0 KB	-