Submission #715709

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
715709	2023-03-27T15:13:37 Z	valerikk	Long Distance Coach (JOI17_coach)	C++17	100 / 100	270 ms	96948 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;
};

struct cht {
	struct line {
		ll k, b;
	};

	bool bad(line l1, line l2, line l3) {
		return __int128(l3.b - l1.b) * (l1.k - l2.k) <= __int128(l2.b - l1.b) * (l1.k - l3.k);
	}

	vector<line> st;

	void add(ll k, ll b) {
		line l = {k, b};
		while (st.size() >= 2 && bad(st[st.size() - 2], st.back(), l)) {
			st.pop_back();
		}
		st.push_back(l);
	}

	bool aft(line l1, line l2, ll x) {
		return (l2.b - l1.b) <= __int128(x) * (l1.k - l2.k);
	}

	ll get(ll x) {
		if (st.empty()) {
			return INF;
		}
		int l = 0, r = st.size();
		while (r - l > 1) {
			int mid = (l + r) / 2;
			if (aft(st[mid - 1], st[mid], x)) {
				l = mid;
			} else {
				r = mid;
			}
		}
		return st[l].k * x + st[l].b;
	}	
};

cht t[2 * N];

ll get(int l, int r, ll x) {
	ll ret = INF;
	for (l += m, r += m; l < r; l >>= 1, r >>= 1) {
		if (l & 1) {
			ret = min(ret, t[l].get(x));
			++l;
		}
		if (r & 1) {
			--r;
			ret = min(ret, t[r].get(x));
		}
	}
	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) {
		for (int j = i + m; j > 0; j >>= 1) {
			t[j].add(-i, dp[i] - prefc[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	6 ms	9684 KB	Output is correct
2	Correct	6 ms	9684 KB	Output is correct
3	Correct	5 ms	9684 KB	Output is correct
4	Correct	5 ms	9724 KB	Output is correct
5	Correct	5 ms	9684 KB	Output is correct
6	Correct	5 ms	9684 KB	Output is correct
7	Correct	5 ms	9684 KB	Output is correct
8	Correct	7 ms	9684 KB	Output is correct
9	Correct	6 ms	9740 KB	Output is correct
10	Correct	5 ms	9684 KB	Output is correct
11	Correct	5 ms	9684 KB	Output is correct
12	Correct	5 ms	9684 KB	Output is correct
13	Correct	5 ms	9684 KB	Output is correct
14	Correct	5 ms	9684 KB	Output is correct
15	Correct	5 ms	9684 KB	Output is correct
16	Correct	5 ms	9684 KB	Output is correct
17	Correct	6 ms	9684 KB	Output is correct
18	Correct	5 ms	9676 KB	Output is correct
19	Correct	5 ms	9684 KB	Output is correct
20	Correct	6 ms	9692 KB	Output is correct
21	Correct	5 ms	9684 KB	Output is correct
22	Correct	5 ms	9684 KB	Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	9684 KB	Output is correct
2	Correct	6 ms	9684 KB	Output is correct
3	Correct	5 ms	9684 KB	Output is correct
4	Correct	5 ms	9724 KB	Output is correct
5	Correct	5 ms	9684 KB	Output is correct
6	Correct	5 ms	9684 KB	Output is correct
7	Correct	5 ms	9684 KB	Output is correct
8	Correct	7 ms	9684 KB	Output is correct
9	Correct	6 ms	9740 KB	Output is correct
10	Correct	5 ms	9684 KB	Output is correct
11	Correct	5 ms	9684 KB	Output is correct
12	Correct	5 ms	9684 KB	Output is correct
13	Correct	5 ms	9684 KB	Output is correct
14	Correct	5 ms	9684 KB	Output is correct
15	Correct	5 ms	9684 KB	Output is correct
16	Correct	5 ms	9684 KB	Output is correct
17	Correct	6 ms	9684 KB	Output is correct
18	Correct	5 ms	9676 KB	Output is correct
19	Correct	5 ms	9684 KB	Output is correct
20	Correct	6 ms	9692 KB	Output is correct
21	Correct	5 ms	9684 KB	Output is correct
22	Correct	5 ms	9684 KB	Output is correct
23	Correct	5 ms	9684 KB	Output is correct
24	Correct	5 ms	9684 KB	Output is correct
25	Correct	6 ms	9780 KB	Output is correct
26	Correct	5 ms	9748 KB	Output is correct
27	Correct	6 ms	9684 KB	Output is correct
28	Correct	5 ms	9684 KB	Output is correct
29	Correct	6 ms	9684 KB	Output is correct
30	Correct	5 ms	9684 KB	Output is correct
31	Correct	5 ms	9684 KB	Output is correct
32	Correct	6 ms	9780 KB	Output is correct
33	Correct	5 ms	9684 KB	Output is correct
34	Correct	5 ms	9684 KB	Output is correct
35	Correct	5 ms	9684 KB	Output is correct
36	Correct	5 ms	9684 KB	Output is correct
37	Correct	5 ms	9684 KB	Output is correct
38	Correct	6 ms	10068 KB	Output is correct
39	Correct	6 ms	10068 KB	Output is correct
40	Correct	7 ms	10068 KB	Output is correct
41	Correct	6 ms	9940 KB	Output is correct
42	Correct	6 ms	9940 KB	Output is correct
43	Correct	7 ms	9940 KB	Output is correct
44	Correct	7 ms	9940 KB	Output is correct
45	Correct	6 ms	10032 KB	Output is correct
46	Correct	7 ms	10324 KB	Output is correct
47	Correct	8 ms	10072 KB	Output is correct
48	Correct	10 ms	10068 KB	Output is correct
49	Correct	8 ms	10068 KB	Output is correct
50	Correct	7 ms	10068 KB	Output is correct
51	Correct	7 ms	10068 KB	Output is correct

Subtask #4
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	9684 KB	Output is correct
2	Correct	6 ms	9684 KB	Output is correct
3	Correct	5 ms	9684 KB	Output is correct
4	Correct	5 ms	9724 KB	Output is correct
5	Correct	5 ms	9684 KB	Output is correct
6	Correct	5 ms	9684 KB	Output is correct
7	Correct	5 ms	9684 KB	Output is correct
8	Correct	7 ms	9684 KB	Output is correct
9	Correct	6 ms	9740 KB	Output is correct
10	Correct	5 ms	9684 KB	Output is correct
11	Correct	5 ms	9684 KB	Output is correct
12	Correct	5 ms	9684 KB	Output is correct
13	Correct	5 ms	9684 KB	Output is correct
14	Correct	5 ms	9684 KB	Output is correct
15	Correct	5 ms	9684 KB	Output is correct
16	Correct	5 ms	9684 KB	Output is correct
17	Correct	6 ms	9684 KB	Output is correct
18	Correct	5 ms	9676 KB	Output is correct
19	Correct	5 ms	9684 KB	Output is correct
20	Correct	6 ms	9692 KB	Output is correct
21	Correct	5 ms	9684 KB	Output is correct
22	Correct	5 ms	9684 KB	Output is correct
23	Correct	5 ms	9684 KB	Output is correct
24	Correct	5 ms	9684 KB	Output is correct
25	Correct	6 ms	9780 KB	Output is correct
26	Correct	5 ms	9748 KB	Output is correct
27	Correct	6 ms	9684 KB	Output is correct
28	Correct	5 ms	9684 KB	Output is correct
29	Correct	6 ms	9684 KB	Output is correct
30	Correct	5 ms	9684 KB	Output is correct
31	Correct	5 ms	9684 KB	Output is correct
32	Correct	6 ms	9780 KB	Output is correct
33	Correct	5 ms	9684 KB	Output is correct
34	Correct	5 ms	9684 KB	Output is correct
35	Correct	5 ms	9684 KB	Output is correct
36	Correct	5 ms	9684 KB	Output is correct
37	Correct	5 ms	9684 KB	Output is correct
38	Correct	6 ms	10068 KB	Output is correct
39	Correct	6 ms	10068 KB	Output is correct
40	Correct	7 ms	10068 KB	Output is correct
41	Correct	6 ms	9940 KB	Output is correct
42	Correct	6 ms	9940 KB	Output is correct
43	Correct	7 ms	9940 KB	Output is correct
44	Correct	7 ms	9940 KB	Output is correct
45	Correct	6 ms	10032 KB	Output is correct
46	Correct	7 ms	10324 KB	Output is correct
47	Correct	8 ms	10072 KB	Output is correct
48	Correct	10 ms	10068 KB	Output is correct
49	Correct	8 ms	10068 KB	Output is correct
50	Correct	7 ms	10068 KB	Output is correct
51	Correct	7 ms	10068 KB	Output is correct
52	Correct	228 ms	42112 KB	Output is correct
53	Correct	231 ms	42132 KB	Output is correct
54	Correct	214 ms	37508 KB	Output is correct
55	Correct	195 ms	42108 KB	Output is correct
56	Correct	213 ms	41608 KB	Output is correct
57	Correct	229 ms	45740 KB	Output is correct
58	Correct	187 ms	42084 KB	Output is correct
59	Correct	195 ms	41872 KB	Output is correct
60	Correct	219 ms	42368 KB	Output is correct
61	Correct	204 ms	44012 KB	Output is correct
62	Correct	223 ms	46388 KB	Output is correct
63	Correct	190 ms	96948 KB	Output is correct
64	Correct	187 ms	46988 KB	Output is correct
65	Correct	220 ms	47104 KB	Output is correct
66	Correct	214 ms	46900 KB	Output is correct
67	Correct	231 ms	47416 KB	Output is correct
68	Correct	213 ms	47848 KB	Output is correct
69	Correct	239 ms	47628 KB	Output is correct
70	Correct	222 ms	47596 KB	Output is correct
71	Correct	223 ms	47576 KB	Output is correct
72	Correct	224 ms	47660 KB	Output is correct
73	Correct	219 ms	47584 KB	Output is correct
74	Correct	226 ms	47164 KB	Output is correct
75	Correct	246 ms	46640 KB	Output is correct
76	Correct	261 ms	46980 KB	Output is correct
77	Correct	252 ms	45824 KB	Output is correct
78	Correct	270 ms	47016 KB	Output is correct
79	Correct	236 ms	47200 KB	Output is correct
80	Correct	230 ms	47272 KB	Output is correct

Submission #715709

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 30.0 / 30.0

Subtask #3 25.0 / 25.0

Subtask #4 29.0 / 29.0

Subtask #1
16.0 / 16.0

Subtask #2
30.0 / 30.0

Subtask #3
25.0 / 25.0

Subtask #4
29.0 / 29.0