Submission #715707

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
715707	2023-03-27T15:07:52 Z	valerikk	Long Distance Coach (JOI17_coach)	C++17	71 / 100	2000 ms	17044 KB

coach

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e5 + 7;
const ll INF = 2e18;

int n, m;
ll X, T, W;
ll s[N];
ll d[N], c[N];
ll cost[N];
ll mn[N];
ll dp[N];
ll prefc[N];

struct seg {
	int l, r;
	ll x, sumcost, mnval;
};

ll get(int l, int r, ll x) {
	ll ret = INF;
	for (int i = l; i < r; ++i) {
		ret = min(ret, dp[i] - prefc[i] - x * i);
	}
	return ret;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> X >> n >> m >> W >> T;
	for (int i = 0; i < n; ++i) {
		cin >> s[i];
	}
	sort(s, s + n);
	s[n++] = X;
	{
		vector<pair<ll, ll>> kek(m);
		for (int i = 0; i < m; ++i) {
			cin >> kek[i].first >> kek[i].second;
		}
		sort(kek.begin(), kek.end());
		for (int i = 0; i < m; ++i) {
			d[i] = kek[i].first;
			c[i] = kek[i].second;
		}
	}
	for (int i = 0; i < m; ++i) {
		cost[i] = ((X - d[i]) / T + 1) * W;
	}
	for (int i = 0; i < m; ++i) {
		mn[i] = INF;
	}
	for (int i = 0; i < n; ++i) {
		int ind = lower_bound(d, d + m, s[i] % T) - d - 1;
		if (ind != -1) {
			mn[ind] = min(mn[ind], s[i] / T * W);
		}
	}
	prefc[0] = 0;
	for (int i = 0; i < m; ++i) {
		prefc[i + 1] = prefc[i] + c[i];
	}
	vector<seg> st;
	st.push_back({0, 0, -1, 0, INF});
	for (int i = 0; i < m; ++i) {
		dp[i + 1] = dp[i] + cost[i];
		if (mn[i] != INF) {
			while (st.back().x >= mn[i]) {
				st.pop_back();
			}
			seg kek;
			kek.l = st.back().r;
			kek.r = i + 1;
			kek.x = mn[i];
			kek.sumcost = st.back().sumcost + kek.x * (kek.r - kek.l);
			ll prefcost = st.back().sumcost;
			kek.mnval = min(st.back().mnval, get(kek.l, kek.r, kek.x) - prefcost + kek.x * kek.l);
			st.push_back(kek);
			if (st.back().mnval != INF) {
				dp[i + 1] = min(dp[i + 1], st.back().mnval + prefc[i + 1] + st.back().sumcost);
			}
		}
	}
	cout << dp[m] + (X / T + 1) * W << "\n";
	return 0;
}

Subtask #1
16.0 / 16.0

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

Subtask #2
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct

Subtask #3
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	424 KB	Output is correct
39	Correct	1 ms	484 KB	Output is correct
40	Correct	1 ms	480 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	2 ms	468 KB	Output is correct
44	Correct	3 ms	468 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	1 ms	596 KB	Output is correct
47	Correct	2 ms	468 KB	Output is correct
48	Correct	1 ms	468 KB	Output is correct
49	Correct	2 ms	468 KB	Output is correct
50	Correct	1 ms	468 KB	Output is correct
51	Correct	1 ms	468 KB	Output is correct

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	0 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	340 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	424 KB	Output is correct
39	Correct	1 ms	484 KB	Output is correct
40	Correct	1 ms	480 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	2 ms	468 KB	Output is correct
44	Correct	3 ms	468 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	1 ms	596 KB	Output is correct
47	Correct	2 ms	468 KB	Output is correct
48	Correct	1 ms	468 KB	Output is correct
49	Correct	2 ms	468 KB	Output is correct
50	Correct	1 ms	468 KB	Output is correct
51	Correct	1 ms	468 KB	Output is correct
52	Correct	128 ms	11216 KB	Output is correct
53	Correct	121 ms	17044 KB	Output is correct
54	Execution timed out	2041 ms	15232 KB	Time limit exceeded
55	Halted	0 ms	0 KB	-

Submission #715707

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 30.0 / 30.0

Subtask #3 25.0 / 25.0

Subtask #4 0 / 29.0

Subtask #1
16.0 / 16.0

Subtask #2
30.0 / 30.0

Subtask #3
25.0 / 25.0

Subtask #4
0 / 29.0