oj.uz

Submission #206490

# Submission time Handle Problem Language Result Execution time Memory
206490 2020-03-03T12:59:04 Z opukittpceno_hhr Semiexpress (JOI17_semiexpress) C++17
18 / 100
 45 ms 70904 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <random>

using namespace std;

#define int long long

const int N = 3001;
const int INF = 1e18 + 239;

int dp[N][N];

int n, k;
int lc, ex, sm;
int t;

vector<int> proc(int sd, int len) {
	if (sd >= t) {
		return {0};
	}
	int wd = sd;
	int delta = t - sd;
	int can = delta / lc;
	vector<int> ret = {can};
	sd += (can) * sm;
	if (ret.back() < len) {
		for (int i = 0; i < k; i++) {
			sd += sm;
			if (sd > t) {
				break;
			}
			can = (t - sd) / lc;
			ret.push_back(ret.back() + can + 1);
			sd += can * sm;
			if (ret.back() > len) {
				ret.back() = len;
				break;
			}
		}
	} else {
		ret.back() = len;
	}
	for (auto &x : ret) {
		if (x < len && wd + len * ex <= t) {
			x++;
		}
	}
	return ret;
}


signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			dp[i][j] = -INF;
		}
	}

	int m;
	cin >> n >> m >> k;
	k -= m;
	cin >> lc >> ex >> sm;
	cin >> t;
	vector<int> s(m);
	for (auto &x : s) {
		cin >> x;
		x--;
	}
	dp[0][0] = 0;
	for (int i = 1; i < m; i++) {
		int len = s[i] - s[i - 1];
		int sd = s[i - 1] * ex;
		auto nw = proc(sd, len);
		for (int j = 0; j < N; j++) {
			for (int tk = min((int)nw.size(), N - j) - 1; tk >= 0; tk--) {
				dp[i][j + tk] = max(dp[i][j + tk], dp[i - 1][j] + nw[tk]);
				break;
			}
			int tk = 0;
			{
				dp[i][j + tk] = max(dp[i][j + tk], dp[i - 1][j] + nw[tk]);
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= k; j++) {
			ans = max(ans, dp[i][j]);
		}
	}
	cout << ans << endl;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 70776 KB Output is correct
2 Correct 42 ms 70880 KB Output is correct
3 Correct 43 ms 70776 KB Output is correct
4 Correct 42 ms 70776 KB Output is correct
5 Correct 42 ms 70776 KB Output is correct
6 Correct 41 ms 70776 KB Output is correct
7 Correct 41 ms 70904 KB Output is correct
8 Correct 42 ms 70776 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 70776 KB Output is correct
2 Correct 42 ms 70880 KB Output is correct
3 Correct 43 ms 70776 KB Output is correct
4 Correct 42 ms 70776 KB Output is correct
5 Correct 42 ms 70776 KB Output is correct
6 Correct 41 ms 70776 KB Output is correct
7 Correct 41 ms 70904 KB Output is correct
8 Correct 42 ms 70776 KB Output is correct
9 Correct 45 ms 70776 KB Output is correct
10 Correct 44 ms 70904 KB Output is correct
11 Correct 44 ms 70776 KB Output is correct
12 Correct 43 ms 70904 KB Output is correct
13 Correct 44 ms 70904 KB Output is correct
14 Incorrect 42 ms 70776 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 70776 KB Output is correct
2 Correct 42 ms 70880 KB Output is correct
3 Correct 43 ms 70776 KB Output is correct
4 Correct 42 ms 70776 KB Output is correct
5 Correct 42 ms 70776 KB Output is correct
6 Correct 41 ms 70776 KB Output is correct
7 Correct 41 ms 70904 KB Output is correct
8 Correct 42 ms 70776 KB Output is correct
9 Correct 45 ms 70776 KB Output is correct
10 Correct 44 ms 70904 KB Output is correct
11 Correct 44 ms 70776 KB Output is correct
12 Correct 43 ms 70904 KB Output is correct
13 Correct 44 ms 70904 KB Output is correct
14 Incorrect 42 ms 70776 KB Output isn't correct
15 Halted 0 ms 0 KB -