oj.uz

Submission #532842

# Submission time Handle Problem Language Result Execution time Memory
532842 2022-03-04T04:44:32 Z rk42745417 Semiexpress (JOI17_semiexpress) C++17
100 / 100
 2 ms 360 KB 
#include <bits/stdc++.h>
using namespace std;

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(0);
using ll = int64_t;
using ull = uint64_t;
using uint = uint32_t;
using ld = long double;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = ll(4e48) + ll(2e15);
const double EPS = 1e-9;
static int LamyIsCute = []() {
	EmiliaMyWife
	return 48763;
}();

signed main() {
	int n, m, k, a, b, c;
	cin >> n >> m >> k >> a >> b >> c;
	k -= m;

	ll t;
	cin >> t;

	vector<ll> arr(m), cur(m), nxt(m);
	for(int i = 0; i < m; i++)
		cin >> arr[i], arr[i]--;

	auto cal = [&](int i) {
		ll g = t - (arr[i] * b + (cur[i] + 1 - arr[i]) * c);
		if(g < 0 || cur[i] + 1 == arr[i + 1]) {
			nxt[i] = cur[i];
			return;
		}
		ll r = min(arr[i + 1] - 1 - (cur[i] + 1), g / a);
		nxt[i] = cur[i] + 1 + r;
	};

	int ans = (arr[m - 1] * b <= t) - 1;
	for(int i = 0; i + 1 < m; i++) {
		ll r = arr[i] * b;
		if(r > t)
			continue;
		ll x = min(arr[i + 1] - arr[i] - 1, (t - r) / a);
		ans += x + 1;
		cur[i] = arr[i] + x;
		cal(i);
	}
	//cerr << ans << '\n';

	while(k--) {
		int mx = 0, id = 0;
		for(int i = 0; i + 1 < m; i++)
			if(nxt[i] - cur[i] > mx)
				mx = nxt[i] - cur[i], id = i;
		if(mx == 0)
			break;
		ans += mx;
		cur[id] = nxt[id];
		cal(id);
	}
	cout << ans << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 360 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct