oj.uz

Submission #202102

# Submission time Handle Problem Language Result Execution time Memory
202102 2020-02-13T21:27:51 Z maruii Long Distance Coach (JOI17_coach) C++14
100 / 100
 318 ms 246432 KB 
#include <bits/stdc++.h>
using namespace std;using ll = long long;using pii = pair<ll, ll>;
#define ff first
#define ss second
int N, M;struct CHT {	struct Node {		pii L;		int l, r;		Node() : L(pii(0, 1e18)), l(-1), r(-1) {}	} A[10000005];	ll f(pii L, int x) { return L.ff * x + L.ss; }	int cnt;	void update(int nn, int s, int e, pii L2) {		pii &L1 = A[nn].L;		if (f(L1, s) > f(L2, s)) swap(L1, L2);		if (f(L1, e) <= f(L2, e)) return;		int m = s + e >> 1;		if (f(L1, m) >= f(L2, m)) {			swap(L1, L2);			if (A[nn].l < 0) A[nn].l = ++cnt, A[cnt].L = L1;			update(A[nn].l, s, m, L2);		}		else {			if (A[nn].r < 0) A[nn].r = ++cnt, A[cnt].L = L1;			update(A[nn].r, m + 1, e, L2);		}	}	void update(ll a, ll b) { update(0, 0, M, pii(a, b)); }	ll query(int nn, int s, int e, int x) {		if (nn < 0 || s > x || e < x) return 1e18;		ll ret = f(A[nn].L, x);		int m = s + e >> 1;		return min({ret, query(A[nn].l, s, m, x), query(A[nn].r, m + 1, e, x)});	}	ll query(int x) { return query(0, 0, M, x); }} cht;ll X, T, W;pii R[200005], P[200005];ll D[200005], H[200005], S[200005];int main() {	ios_base::sync_with_stdio(0), cin.tie(0);	cin >> X >> N >> M >> W >> T;	for (int i = 0; i < N; ++i) {		ll x; cin >> x;		R[i] = {x % T, x / T};	}	for (int i = 1; i <= M; ++i) cin >> P[i].ff >> P[i].ss;	R[N] = {X % T, X / T};	sort(R, R + N + 1);	sort(P + 1, P + M + 1);	for (int i = 1; i <= M; ++i) {		S[i] = S[i - 1] + P[i].ss;		H[i] = X / T + (X % T >= P[i].ff);	}	H[0] = X / T + 1;	for (int i = M, j = N; i; --i) {		while (j >= 0 && R[j].ff > P[i].ff) {			cht.update(-W * R[j].ss, D[i + 1] + S[i] + W * i * R[j].ss);			--j;		}		D[i] = min(cht.query(i - 1) - S[i - 1], D[i + 1] + H[i] * W);	}	cout << D[1] + H[0] * W;	return 0;}

Compilation message

coach.cpp: In member function 'void CHT::update(int, int, int, pii)':
coach.cpp:5:320: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 int N, M;struct CHT { struct Node {  pii L;  int l, r;  Node() : L(pii(0, 1e18)), l(-1), r(-1) {} } A[10000005]; ll f(pii L, int x) { return L.ff * x + L.ss; } int cnt; void update(int nn, int s, int e, pii L2) {  pii &L1 = A[nn].L;  if (f(L1, s) > f(L2, s)) swap(L1, L2);  if (f(L1, e) <= f(L2, e)) return;  int m = s + e >> 1;  if (f(L1, m) >= f(L2, m)) {   swap(L1, L2);   if (A[nn].l < 0) A[nn].l = ++cnt, A[cnt].L = L1;   update(A[nn].l, s, m, L2);  }  else {   if (A[nn].r < 0) A[nn].r = ++cnt, A[cnt].L = L1;   update(A[nn].r, m + 1, e, L2);  } } void update(ll a, ll b) { update(0, 0, M, pii(a, b)); } ll query(int nn, int s, int e, int x) {  if (nn < 0 || s > x || e < x) return 1e18;  ll ret = f(A[nn].L, x);  int m = s + e >> 1;  return min({ret, query(A[nn].l, s, m, x), query(A[nn].r, m + 1, e, x)}); } ll query(int x) { return query(0, 0, M, x); }} cht;ll X, T, W;pii R[200005], P[200005];ll D[200005], H[200005], S[200005];int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> X >> N >> M >> W >> T; for (int i = 0; i < N; ++i) {  ll x; cin >> x;  R[i] = {x % T, x / T}; } for (int i = 1; i <= M; ++i) cin >> P[i].ff >> P[i].ss; R[N] = {X % T, X / T}; sort(R, R + N + 1); sort(P + 1, P + M + 1); for (int i = 1; i <= M; ++i) {  S[i] = S[i - 1] + P[i].ss;  H[i] = X / T + (X % T >= P[i].ff); } H[0] = X / T + 1; for (int i = M, j = N; i; --i) {  while (j >= 0 && R[j].ff > P[i].ff) {   cht.update(-W * R[j].ss, D[i + 1] + S[i] + W * i * R[j].ss);   --j;  }  D[i] = min(cht.query(i - 1) - S[i - 1], D[i + 1] + H[i] * W); } cout << D[1] + H[0] * W; return 0;}
                                                                                                                                                                                                                                                                                                                              ~~^~~
coach.cpp: In member function 'll CHT::query(int, int, int, int)':
coach.cpp:5:731: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 int N, M;struct CHT { struct Node {  pii L;  int l, r;  Node() : L(pii(0, 1e18)), l(-1), r(-1) {} } A[10000005]; ll f(pii L, int x) { return L.ff * x + L.ss; } int cnt; void update(int nn, int s, int e, pii L2) {  pii &L1 = A[nn].L;  if (f(L1, s) > f(L2, s)) swap(L1, L2);  if (f(L1, e) <= f(L2, e)) return;  int m = s + e >> 1;  if (f(L1, m) >= f(L2, m)) {   swap(L1, L2);   if (A[nn].l < 0) A[nn].l = ++cnt, A[cnt].L = L1;   update(A[nn].l, s, m, L2);  }  else {   if (A[nn].r < 0) A[nn].r = ++cnt, A[cnt].L = L1;   update(A[nn].r, m + 1, e, L2);  } } void update(ll a, ll b) { update(0, 0, M, pii(a, b)); } ll query(int nn, int s, int e, int x) {  if (nn < 0 || s > x || e < x) return 1e18;  ll ret = f(A[nn].L, x);  int m = s + e >> 1;  return min({ret, query(A[nn].l, s, m, x), query(A[nn].r, m + 1, e, x)}); } ll query(int x) { return query(0, 0, M, x); }} cht;ll X, T, W;pii R[200005], P[200005];ll D[200005], H[200005], S[200005];int main() { ios_base::sync_with_stdio(0), cin.tie(0); cin >> X >> N >> M >> W >> T; for (int i = 0; i < N; ++i) {  ll x; cin >> x;  R[i] = {x % T, x / T}; } for (int i = 1; i <= M; ++i) cin >> P[i].ff >> P[i].ss; R[N] = {X % T, X / T}; sort(R, R + N + 1); sort(P + 1, P + M + 1); for (int i = 1; i <= M; ++i) {  S[i] = S[i - 1] + P[i].ss;  H[i] = X / T + (X % T >= P[i].ff); } H[0] = X / T + 1; for (int i = M, j = N; i; --i) {  while (j >= 0 && R[j].ff > P[i].ff) {   cht.update(-W * R[j].ss, D[i + 1] + S[i] + W * i * R[j].ss);   --j;  }  D[i] = min(cht.query(i - 1) - S[i - 1], D[i + 1] + H[i] * W); } cout << D[1] + H[0] * W; return 0;}
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 235188 KB Output is correct
2 Correct 133 ms 235256 KB Output is correct
3 Correct 134 ms 235128 KB Output is correct
4 Correct 131 ms 235256 KB Output is correct
5 Correct 131 ms 235256 KB Output is correct
6 Correct 130 ms 235256 KB Output is correct
7 Correct 133 ms 235128 KB Output is correct
8 Correct 130 ms 235232 KB Output is correct
9 Correct 134 ms 235176 KB Output is correct
10 Correct 134 ms 235128 KB Output is correct
11 Correct 132 ms 235128 KB Output is correct
12 Correct 127 ms 235128 KB Output is correct
13 Correct 133 ms 235152 KB Output is correct
14 Correct 148 ms 235128 KB Output is correct
15 Correct 136 ms 235128 KB Output is correct
16 Correct 131 ms 235256 KB Output is correct
17 Correct 130 ms 235260 KB Output is correct
18 Correct 147 ms 235256 KB Output is correct
19 Correct 127 ms 235128 KB Output is correct
20 Correct 129 ms 235128 KB Output is correct
21 Correct 140 ms 235248 KB Output is correct
22 Correct 129 ms 235220 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 235188 KB Output is correct
2 Correct 133 ms 235256 KB Output is correct
3 Correct 134 ms 235128 KB Output is correct
4 Correct 131 ms 235256 KB Output is correct
5 Correct 131 ms 235256 KB Output is correct
6 Correct 130 ms 235256 KB Output is correct
7 Correct 133 ms 235128 KB Output is correct
8 Correct 130 ms 235232 KB Output is correct
9 Correct 134 ms 235176 KB Output is correct
10 Correct 134 ms 235128 KB Output is correct
11 Correct 132 ms 235128 KB Output is correct
12 Correct 127 ms 235128 KB Output is correct
13 Correct 133 ms 235152 KB Output is correct
14 Correct 148 ms 235128 KB Output is correct
15 Correct 136 ms 235128 KB Output is correct
16 Correct 131 ms 235256 KB Output is correct
17 Correct 130 ms 235260 KB Output is correct
18 Correct 147 ms 235256 KB Output is correct
19 Correct 127 ms 235128 KB Output is correct
20 Correct 129 ms 235128 KB Output is correct
21 Correct 140 ms 235248 KB Output is correct
22 Correct 129 ms 235220 KB Output is correct
23 Correct 138 ms 235148 KB Output is correct
24 Correct 135 ms 235256 KB Output is correct
25 Correct 133 ms 235256 KB Output is correct
26 Correct 129 ms 235196 KB Output is correct
27 Correct 133 ms 235256 KB Output is correct
28 Correct 130 ms 235256 KB Output is correct
29 Correct 131 ms 235260 KB Output is correct
30 Correct 132 ms 235256 KB Output is correct
31 Correct 152 ms 235256 KB Output is correct
32 Correct 133 ms 235256 KB Output is correct
33 Correct 132 ms 235240 KB Output is correct
34 Correct 139 ms 235180 KB Output is correct
35 Correct 132 ms 235256 KB Output is correct
36 Correct 131 ms 235128 KB Output is correct
37 Correct 132 ms 235256 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 235188 KB Output is correct
2 Correct 133 ms 235256 KB Output is correct
3 Correct 134 ms 235128 KB Output is correct
4 Correct 131 ms 235256 KB Output is correct
5 Correct 131 ms 235256 KB Output is correct
6 Correct 130 ms 235256 KB Output is correct
7 Correct 133 ms 235128 KB Output is correct
8 Correct 130 ms 235232 KB Output is correct
9 Correct 134 ms 235176 KB Output is correct
10 Correct 134 ms 235128 KB Output is correct
11 Correct 132 ms 235128 KB Output is correct
12 Correct 127 ms 235128 KB Output is correct
13 Correct 133 ms 235152 KB Output is correct
14 Correct 148 ms 235128 KB Output is correct
15 Correct 136 ms 235128 KB Output is correct
16 Correct 131 ms 235256 KB Output is correct
17 Correct 130 ms 235260 KB Output is correct
18 Correct 147 ms 235256 KB Output is correct
19 Correct 127 ms 235128 KB Output is correct
20 Correct 129 ms 235128 KB Output is correct
21 Correct 140 ms 235248 KB Output is correct
22 Correct 129 ms 235220 KB Output is correct
23 Correct 138 ms 235148 KB Output is correct
24 Correct 135 ms 235256 KB Output is correct
25 Correct 133 ms 235256 KB Output is correct
26 Correct 129 ms 235196 KB Output is correct
27 Correct 133 ms 235256 KB Output is correct
28 Correct 130 ms 235256 KB Output is correct
29 Correct 131 ms 235260 KB Output is correct
30 Correct 132 ms 235256 KB Output is correct
31 Correct 152 ms 235256 KB Output is correct
32 Correct 133 ms 235256 KB Output is correct
33 Correct 132 ms 235240 KB Output is correct
34 Correct 139 ms 235180 KB Output is correct
35 Correct 132 ms 235256 KB Output is correct
36 Correct 131 ms 235128 KB Output is correct
37 Correct 132 ms 235256 KB Output is correct
38 Correct 136 ms 235300 KB Output is correct
39 Correct 151 ms 235256 KB Output is correct
40 Correct 136 ms 235384 KB Output is correct
41 Correct 143 ms 235256 KB Output is correct
42 Correct 132 ms 235256 KB Output is correct
43 Correct 151 ms 235256 KB Output is correct
44 Correct 136 ms 235384 KB Output is correct
45 Correct 132 ms 235256 KB Output is correct
46 Correct 136 ms 235396 KB Output is correct
47 Correct 133 ms 235332 KB Output is correct
48 Correct 145 ms 235348 KB Output is correct
49 Correct 149 ms 235260 KB Output is correct
50 Correct 134 ms 235256 KB Output is correct
51 Correct 135 ms 235256 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 235188 KB Output is correct
2 Correct 133 ms 235256 KB Output is correct
3 Correct 134 ms 235128 KB Output is correct
4 Correct 131 ms 235256 KB Output is correct
5 Correct 131 ms 235256 KB Output is correct
6 Correct 130 ms 235256 KB Output is correct
7 Correct 133 ms 235128 KB Output is correct
8 Correct 130 ms 235232 KB Output is correct
9 Correct 134 ms 235176 KB Output is correct
10 Correct 134 ms 235128 KB Output is correct
11 Correct 132 ms 235128 KB Output is correct
12 Correct 127 ms 235128 KB Output is correct
13 Correct 133 ms 235152 KB Output is correct
14 Correct 148 ms 235128 KB Output is correct
15 Correct 136 ms 235128 KB Output is correct
16 Correct 131 ms 235256 KB Output is correct
17 Correct 130 ms 235260 KB Output is correct
18 Correct 147 ms 235256 KB Output is correct
19 Correct 127 ms 235128 KB Output is correct
20 Correct 129 ms 235128 KB Output is correct
21 Correct 140 ms 235248 KB Output is correct
22 Correct 129 ms 235220 KB Output is correct
23 Correct 138 ms 235148 KB Output is correct
24 Correct 135 ms 235256 KB Output is correct
25 Correct 133 ms 235256 KB Output is correct
26 Correct 129 ms 235196 KB Output is correct
27 Correct 133 ms 235256 KB Output is correct
28 Correct 130 ms 235256 KB Output is correct
29 Correct 131 ms 235260 KB Output is correct
30 Correct 132 ms 235256 KB Output is correct
31 Correct 152 ms 235256 KB Output is correct
32 Correct 133 ms 235256 KB Output is correct
33 Correct 132 ms 235240 KB Output is correct
34 Correct 139 ms 235180 KB Output is correct
35 Correct 132 ms 235256 KB Output is correct
36 Correct 131 ms 235128 KB Output is correct
37 Correct 132 ms 235256 KB Output is correct
38 Correct 136 ms 235300 KB Output is correct
39 Correct 151 ms 235256 KB Output is correct
40 Correct 136 ms 235384 KB Output is correct
41 Correct 143 ms 235256 KB Output is correct
42 Correct 132 ms 235256 KB Output is correct
43 Correct 151 ms 235256 KB Output is correct
44 Correct 136 ms 235384 KB Output is correct
45 Correct 132 ms 235256 KB Output is correct
46 Correct 136 ms 235396 KB Output is correct
47 Correct 133 ms 235332 KB Output is correct
48 Correct 145 ms 235348 KB Output is correct
49 Correct 149 ms 235260 KB Output is correct
50 Correct 134 ms 235256 KB Output is correct
51 Correct 135 ms 235256 KB Output is correct
52 Correct 313 ms 246264 KB Output is correct
53 Correct 291 ms 246264 KB Output is correct
54 Correct 266 ms 246340 KB Output is correct
55 Correct 272 ms 246264 KB Output is correct
56 Correct 259 ms 246264 KB Output is correct
57 Correct 272 ms 246432 KB Output is correct
58 Correct 273 ms 246264 KB Output is correct
59 Correct 269 ms 246332 KB Output is correct
60 Correct 263 ms 246208 KB Output is correct
61 Correct 262 ms 246136 KB Output is correct
62 Correct 272 ms 246136 KB Output is correct
63 Correct 250 ms 246136 KB Output is correct
64 Correct 223 ms 246264 KB Output is correct
65 Correct 299 ms 246264 KB Output is correct
66 Correct 300 ms 246136 KB Output is correct
67 Correct 291 ms 246136 KB Output is correct
68 Correct 275 ms 246136 KB Output is correct
69 Correct 312 ms 246136 KB Output is correct
70 Correct 298 ms 246112 KB Output is correct
71 Correct 318 ms 246112 KB Output is correct
72 Correct 294 ms 246112 KB Output is correct
73 Correct 297 ms 246136 KB Output is correct
74 Correct 308 ms 246264 KB Output is correct
75 Correct 301 ms 246136 KB Output is correct
76 Correct 300 ms 246140 KB Output is correct
77 Correct 258 ms 246136 KB Output is correct
78 Correct 258 ms 246136 KB Output is correct
79 Correct 291 ms 246136 KB Output is correct
80 Correct 290 ms 246136 KB Output is correct