oj.uz

Submission #298605

# Submission time Handle Problem Language Result Execution time Memory
298605 2020-09-13T13:15:05 Z reymontada61 Semiexpress (JOI17_semiexpress) C++14
100 / 100
 12 ms 4592 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

int n, m, k;
int a, b, c;
int t, extra;
const int MXM = 3005;
int pos[MXM];
int curr = 0;

signed main() {

	cin >> n >> m >> k;
	cin >> a >> b >> c;
	cin >> t;
	
	for (int i=1; i<=m; i++) {
		cin >> pos[i];
	}
	
	extra = k - m;
	priority_queue<int> pr;
	
	for (int i=1; i<m; i++) {
		int left = t - (pos[i] - 1) * b;
		if (left < 0) continue;
		int far = min(pos[i+1]-1, pos[i]+left/a);
		curr += (far - pos[i] + 1);
		int min_no = far + 1;
		int here = 1;
		bool can = true;
		while (min_no < pos[i+1] && here <= extra && can) {
			int ti = t - ((pos[i] - 1) * b + (min_no - pos[i]) * c);
			if (ti >= 0) {
				int far = min(min_no + ti / a, pos[i+1]-1);
				int hm = far - min_no + 1;
				pr.push(hm);
				here++;
				min_no = far + 1;
			}
			else {
				can = false;
			}
		}
	}
	
	curr--;
	
	{
		if (t - (pos[m] - 1) * b >= 0) {
			curr++;
		}
	}
	
	int best = 0;
	
	for (int i=0; i<extra; i++) {
		if (!pr.empty()) {
			best += pr.top();
			pr.pop();
		}
	}
	
	cout << best + curr << endl;
	
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 256 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 12 ms 4592 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 7 ms 4592 KB Output is correct
30 Correct 5 ms 2548 KB Output is correct