oj.uz

Submission #559992

# Submission time Handle Problem Language Result Execution time Memory
559992 2022-05-11T02:30:27 Z amunduzbaev Sparklers (JOI17_sparklers) C++17
50 / 100
 173 ms 262144 KB 
#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<vector<int>> dp(n, vector<int>(n, -1));
		dp[k][k] = t * s;
		for(int len=0;len<n;len++){
			for(int i=0;i+len<n;i++){
				int j=i+len;
				if(j+1<n){
					int D = d[j+1] / 2;
					if(dp[i][j] >= D){
						dp[i][j+1] = max(dp[i][j+1], dp[i][j] - D + t * s);
					}
				} if(i){
					int D = d[i] / 2;
					if(dp[i][j] >= D){
						dp[i-1][j] = max(dp[i-1][j], dp[i][j] - D + t * s);
					}
				}
			}
		}
		
		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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 73 ms 4584 KB Output is correct
23 Correct 43 ms 2940 KB Output is correct
24 Correct 66 ms 4592 KB Output is correct
25 Correct 140 ms 8492 KB Output is correct
26 Correct 140 ms 8280 KB Output is correct
27 Correct 147 ms 8300 KB Output is correct
28 Correct 157 ms 8332 KB Output is correct
29 Correct 157 ms 8280 KB Output is correct
30 Correct 146 ms 8292 KB Output is correct
31 Correct 148 ms 8224 KB Output is correct
32 Correct 155 ms 8500 KB Output is correct
33 Correct 171 ms 8512 KB Output is correct
34 Correct 141 ms 8292 KB Output is correct
35 Correct 152 ms 8316 KB Output is correct
36 Correct 146 ms 8396 KB Output is correct
37 Correct 139 ms 8368 KB Output is correct
38 Correct 152 ms 8284 KB Output is correct
39 Correct 137 ms 8552 KB Output is correct
40 Correct 173 ms 8376 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 73 ms 4584 KB Output is correct
23 Correct 43 ms 2940 KB Output is correct
24 Correct 66 ms 4592 KB Output is correct
25 Correct 140 ms 8492 KB Output is correct
26 Correct 140 ms 8280 KB Output is correct
27 Correct 147 ms 8300 KB Output is correct
28 Correct 157 ms 8332 KB Output is correct
29 Correct 157 ms 8280 KB Output is correct
30 Correct 146 ms 8292 KB Output is correct
31 Correct 148 ms 8224 KB Output is correct
32 Correct 155 ms 8500 KB Output is correct
33 Correct 171 ms 8512 KB Output is correct
34 Correct 141 ms 8292 KB Output is correct
35 Correct 152 ms 8316 KB Output is correct
36 Correct 146 ms 8396 KB Output is correct
37 Correct 139 ms 8368 KB Output is correct
38 Correct 152 ms 8284 KB Output is correct
39 Correct 137 ms 8552 KB Output is correct
40 Correct 173 ms 8376 KB Output is correct
41 Runtime error 103 ms 262144 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -