Submission #534845

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
534845	2022-03-09T04:01:43 Z	8e7	Long Distance Coach (JOI17_coach)	C++17	100 / 100	197 ms	26512 KB

coach

//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 200005
#define pii pair<ll, ll>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
const ll inf = 1LL<<60;
ll s[maxn];
pii a[maxn];
ll cost[maxn], pref[maxn];

struct line{
	ll m, k;
	line(){m = 0, k = -inf;}
	line(ll a, ll b){m = a, k = b;}
	ll getval(ll x){return m*x + k;}
};
vector<pii> vec[maxn];
ll dp[maxn];
int main() {
	io
	ll x, n, m, w, t;
	cin >> x >> n >> m >> w >> t;
	for (int i = 1;i <= n;i++) cin >> s[i];	
	sort(s + 1, s + 1 + n);
	for (int i = 0;i < m;i++) {
		cin >> a[i].ff >> a[i].ss;
	}
	sort(a, a + m);
	for (int j = 0;j < m;j++) {
		cost[j] = w * ((x - a[j].ff) / t + 1);
		pref[j] = a[j].ss;
		if (j) cost[j] += cost[j-1], pref[j] += pref[j-1];
	}
	s[n+1] = x;
	for (int i = 0;i <= n;i++) {
		ll lef, rig;
		if (s[i] / t != s[i+1] / t) {
			lef = 1, rig = s[i+1] % t - 1;	
		} else {
			lef = s[i] % t, rig = s[i+1] % t - 1;
		}
		lef = lower_bound(a, a + m, make_pair(lef, (ll)-1)) - a;
		rig = upper_bound(a, a + m, make_pair(rig, 1LL<<60)) - a - 1; //[lef, rig]	

		debug(lef, rig, s[i+1]/t);
		vec[rig].push_back({lef, s[i+1]/t});
	}
	vector<line> conv;	
	conv.push_back(line(w, 0));
	auto search = [&] (ll p) {
		int low = 0, up = conv.size();
		while (low < up - 1) {
			int mid = (low + up) / 2;
			if (conv[mid].getval(p) < conv[mid-1].getval(p)) low = mid;
			else up = mid;
		}
		return conv[low].getval(p);
	};
	for (int i = 0;i < m;i++) {
		if (i) dp[i] = min(dp[i], dp[i-1]);
		for (auto [l, h]:vec[i]) {
			dp[i] = min(dp[i], search(h) + pref[i] - cost[i] + h * w * i);	
		}
		line add(-i*w, dp[i] + cost[i] - pref[i]);
		while (conv.size() > 1) {
			line p1 = conv[conv.size() - 2], p2 = conv.back();	
			ll pnt = (p2.k - p1.k + p1.m - p2.m - 1) / (p1.m - p2.m);		
			if (p2.getval(pnt) >= add.getval(pnt)) {
				conv.pop_back();
			} else {
				break;
			}
		}
		conv.push_back(add);
	}
	
	cout << dp[m-1] + cost[m-1] + (x / t + 1) * w<< endl;
}

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:12:20: warning: statement has no effect [-Wunused-value]
   12 | #define debug(...) 0
      |                    ^
coach.cpp:60:3: note: in expansion of macro 'debug'
   60 |   debug(lef, rig, s[i+1]/t);
      |   ^~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	3 ms	5020 KB	Output is correct
3	Correct	3 ms	5020 KB	Output is correct
4	Correct	3 ms	4940 KB	Output is correct
5	Correct	3 ms	5020 KB	Output is correct
6	Correct	3 ms	4940 KB	Output is correct
7	Correct	3 ms	5016 KB	Output is correct
8	Correct	3 ms	4940 KB	Output is correct
9	Correct	3 ms	4940 KB	Output is correct
10	Correct	3 ms	4940 KB	Output is correct
11	Correct	3 ms	4940 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	3 ms	5020 KB	Output is correct
14	Correct	3 ms	4940 KB	Output is correct
15	Correct	3 ms	4940 KB	Output is correct
16	Correct	3 ms	4992 KB	Output is correct
17	Correct	4 ms	4940 KB	Output is correct
18	Correct	3 ms	4940 KB	Output is correct
19	Correct	3 ms	4940 KB	Output is correct
20	Correct	3 ms	4940 KB	Output is correct
21	Correct	3 ms	4940 KB	Output is correct
22	Correct	4 ms	4940 KB	Output is correct
23	Correct	3 ms	4940 KB	Output is correct
24	Correct	3 ms	5020 KB	Output is correct
25	Correct	3 ms	5016 KB	Output is correct
26	Correct	3 ms	5024 KB	Output is correct
27	Correct	3 ms	4940 KB	Output is correct
28	Correct	3 ms	4940 KB	Output is correct
29	Correct	3 ms	4940 KB	Output is correct
30	Correct	4 ms	5068 KB	Output is correct
31	Correct	3 ms	4940 KB	Output is correct
32	Correct	3 ms	5016 KB	Output is correct
33	Correct	3 ms	4940 KB	Output is correct
34	Correct	4 ms	4940 KB	Output is correct
35	Correct	3 ms	4940 KB	Output is correct
36	Correct	3 ms	5020 KB	Output is correct
37	Correct	4 ms	4940 KB	Output is correct
38	Correct	5 ms	5140 KB	Output is correct
39	Correct	4 ms	5196 KB	Output is correct
40	Correct	4 ms	5196 KB	Output is correct
41	Correct	4 ms	5196 KB	Output is correct
42	Correct	4 ms	5196 KB	Output is correct
43	Correct	4 ms	5196 KB	Output is correct
44	Correct	4 ms	5068 KB	Output is correct
45	Correct	5 ms	5068 KB	Output is correct
46	Correct	4 ms	5196 KB	Output is correct
47	Correct	4 ms	5196 KB	Output is correct
48	Correct	5 ms	5196 KB	Output is correct
49	Correct	4 ms	5160 KB	Output is correct
50	Correct	4 ms	5196 KB	Output is correct
51	Correct	4 ms	5156 KB	Output is correct

Subtask #4
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	3 ms	5020 KB	Output is correct
3	Correct	3 ms	5020 KB	Output is correct
4	Correct	3 ms	4940 KB	Output is correct
5	Correct	3 ms	5020 KB	Output is correct
6	Correct	3 ms	4940 KB	Output is correct
7	Correct	3 ms	5016 KB	Output is correct
8	Correct	3 ms	4940 KB	Output is correct
9	Correct	3 ms	4940 KB	Output is correct
10	Correct	3 ms	4940 KB	Output is correct
11	Correct	3 ms	4940 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	3 ms	5020 KB	Output is correct
14	Correct	3 ms	4940 KB	Output is correct
15	Correct	3 ms	4940 KB	Output is correct
16	Correct	3 ms	4992 KB	Output is correct
17	Correct	4 ms	4940 KB	Output is correct
18	Correct	3 ms	4940 KB	Output is correct
19	Correct	3 ms	4940 KB	Output is correct
20	Correct	3 ms	4940 KB	Output is correct
21	Correct	3 ms	4940 KB	Output is correct
22	Correct	4 ms	4940 KB	Output is correct
23	Correct	3 ms	4940 KB	Output is correct
24	Correct	3 ms	5020 KB	Output is correct
25	Correct	3 ms	5016 KB	Output is correct
26	Correct	3 ms	5024 KB	Output is correct
27	Correct	3 ms	4940 KB	Output is correct
28	Correct	3 ms	4940 KB	Output is correct
29	Correct	3 ms	4940 KB	Output is correct
30	Correct	4 ms	5068 KB	Output is correct
31	Correct	3 ms	4940 KB	Output is correct
32	Correct	3 ms	5016 KB	Output is correct
33	Correct	3 ms	4940 KB	Output is correct
34	Correct	4 ms	4940 KB	Output is correct
35	Correct	3 ms	4940 KB	Output is correct
36	Correct	3 ms	5020 KB	Output is correct
37	Correct	4 ms	4940 KB	Output is correct
38	Correct	5 ms	5140 KB	Output is correct
39	Correct	4 ms	5196 KB	Output is correct
40	Correct	4 ms	5196 KB	Output is correct
41	Correct	4 ms	5196 KB	Output is correct
42	Correct	4 ms	5196 KB	Output is correct
43	Correct	4 ms	5196 KB	Output is correct
44	Correct	4 ms	5068 KB	Output is correct
45	Correct	5 ms	5068 KB	Output is correct
46	Correct	4 ms	5196 KB	Output is correct
47	Correct	4 ms	5196 KB	Output is correct
48	Correct	5 ms	5196 KB	Output is correct
49	Correct	4 ms	5160 KB	Output is correct
50	Correct	4 ms	5196 KB	Output is correct
51	Correct	4 ms	5156 KB	Output is correct
52	Correct	182 ms	19688 KB	Output is correct
53	Correct	169 ms	25968 KB	Output is correct
54	Correct	128 ms	23120 KB	Output is correct
55	Correct	125 ms	24360 KB	Output is correct
56	Correct	129 ms	24772 KB	Output is correct
57	Correct	133 ms	20484 KB	Output is correct
58	Correct	128 ms	25104 KB	Output is correct
59	Correct	127 ms	24388 KB	Output is correct
60	Correct	123 ms	23892 KB	Output is correct
61	Correct	127 ms	24304 KB	Output is correct
62	Correct	126 ms	19780 KB	Output is correct
63	Correct	94 ms	26512 KB	Output is correct
64	Correct	125 ms	21360 KB	Output is correct
65	Correct	158 ms	21672 KB	Output is correct
66	Correct	158 ms	25736 KB	Output is correct
67	Correct	160 ms	26180 KB	Output is correct
68	Correct	163 ms	25236 KB	Output is correct
69	Correct	178 ms	24900 KB	Output is correct
70	Correct	178 ms	24852 KB	Output is correct
71	Correct	181 ms	22992 KB	Output is correct
72	Correct	175 ms	24096 KB	Output is correct
73	Correct	179 ms	24340 KB	Output is correct
74	Correct	173 ms	24484 KB	Output is correct
75	Correct	197 ms	24360 KB	Output is correct
76	Correct	178 ms	25152 KB	Output is correct
77	Correct	139 ms	24612 KB	Output is correct
78	Correct	139 ms	24620 KB	Output is correct
79	Correct	179 ms	23236 KB	Output is correct
80	Correct	171 ms	24468 KB	Output is correct

Submission #534845

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