답안 #200832

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200832	2020-02-08T09:22:19 Z	maruii	Long Distance Coach (JOI17_coach)	C++14	71 / 100	314 ms	246268 KB

coach

#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:21:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s + e >> 1;
           ~~^~~
coach.cpp: In member function 'll CHT::query(int, int, int, int)':
coach.cpp:36:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s + e >> 1;
           ~~^~~

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	184 ms	235148 KB	Output is correct
2	Correct	129 ms	235256 KB	Output is correct
3	Correct	134 ms	235256 KB	Output is correct
4	Correct	130 ms	235128 KB	Output is correct
5	Correct	130 ms	235128 KB	Output is correct
6	Correct	134 ms	235256 KB	Output is correct
7	Correct	130 ms	235128 KB	Output is correct
8	Correct	132 ms	235384 KB	Output is correct
9	Correct	127 ms	235128 KB	Output is correct
10	Correct	135 ms	235128 KB	Output is correct
11	Correct	125 ms	235128 KB	Output is correct
12	Correct	135 ms	235136 KB	Output is correct
13	Correct	134 ms	235256 KB	Output is correct
14	Correct	132 ms	235128 KB	Output is correct
15	Correct	130 ms	235128 KB	Output is correct
16	Correct	129 ms	235232 KB	Output is correct
17	Correct	129 ms	235128 KB	Output is correct
18	Correct	130 ms	235128 KB	Output is correct
19	Correct	129 ms	235128 KB	Output is correct
20	Correct	129 ms	235256 KB	Output is correct
21	Correct	128 ms	235128 KB	Output is correct
22	Correct	132 ms	235256 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	184 ms	235148 KB	Output is correct
2	Correct	129 ms	235256 KB	Output is correct
3	Correct	134 ms	235256 KB	Output is correct
4	Correct	130 ms	235128 KB	Output is correct
5	Correct	130 ms	235128 KB	Output is correct
6	Correct	134 ms	235256 KB	Output is correct
7	Correct	130 ms	235128 KB	Output is correct
8	Correct	132 ms	235384 KB	Output is correct
9	Correct	127 ms	235128 KB	Output is correct
10	Correct	135 ms	235128 KB	Output is correct
11	Correct	125 ms	235128 KB	Output is correct
12	Correct	135 ms	235136 KB	Output is correct
13	Correct	134 ms	235256 KB	Output is correct
14	Correct	132 ms	235128 KB	Output is correct
15	Correct	130 ms	235128 KB	Output is correct
16	Correct	129 ms	235232 KB	Output is correct
17	Correct	129 ms	235128 KB	Output is correct
18	Correct	130 ms	235128 KB	Output is correct
19	Correct	129 ms	235128 KB	Output is correct
20	Correct	129 ms	235256 KB	Output is correct
21	Correct	128 ms	235128 KB	Output is correct
22	Correct	132 ms	235256 KB	Output is correct
23	Correct	133 ms	235252 KB	Output is correct
24	Correct	129 ms	235256 KB	Output is correct
25	Correct	127 ms	235260 KB	Output is correct
26	Correct	130 ms	235256 KB	Output is correct
27	Correct	132 ms	235256 KB	Output is correct
28	Correct	130 ms	235232 KB	Output is correct
29	Correct	129 ms	235256 KB	Output is correct
30	Correct	138 ms	235256 KB	Output is correct
31	Correct	129 ms	235256 KB	Output is correct
32	Correct	135 ms	235256 KB	Output is correct
33	Correct	138 ms	235256 KB	Output is correct
34	Correct	130 ms	235156 KB	Output is correct
35	Correct	130 ms	235256 KB	Output is correct
36	Correct	128 ms	235256 KB	Output is correct
37	Correct	131 ms	235256 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	184 ms	235148 KB	Output is correct
2	Correct	129 ms	235256 KB	Output is correct
3	Correct	134 ms	235256 KB	Output is correct
4	Correct	130 ms	235128 KB	Output is correct
5	Correct	130 ms	235128 KB	Output is correct
6	Correct	134 ms	235256 KB	Output is correct
7	Correct	130 ms	235128 KB	Output is correct
8	Correct	132 ms	235384 KB	Output is correct
9	Correct	127 ms	235128 KB	Output is correct
10	Correct	135 ms	235128 KB	Output is correct
11	Correct	125 ms	235128 KB	Output is correct
12	Correct	135 ms	235136 KB	Output is correct
13	Correct	134 ms	235256 KB	Output is correct
14	Correct	132 ms	235128 KB	Output is correct
15	Correct	130 ms	235128 KB	Output is correct
16	Correct	129 ms	235232 KB	Output is correct
17	Correct	129 ms	235128 KB	Output is correct
18	Correct	130 ms	235128 KB	Output is correct
19	Correct	129 ms	235128 KB	Output is correct
20	Correct	129 ms	235256 KB	Output is correct
21	Correct	128 ms	235128 KB	Output is correct
22	Correct	132 ms	235256 KB	Output is correct
23	Correct	133 ms	235252 KB	Output is correct
24	Correct	129 ms	235256 KB	Output is correct
25	Correct	127 ms	235260 KB	Output is correct
26	Correct	130 ms	235256 KB	Output is correct
27	Correct	132 ms	235256 KB	Output is correct
28	Correct	130 ms	235232 KB	Output is correct
29	Correct	129 ms	235256 KB	Output is correct
30	Correct	138 ms	235256 KB	Output is correct
31	Correct	129 ms	235256 KB	Output is correct
32	Correct	135 ms	235256 KB	Output is correct
33	Correct	138 ms	235256 KB	Output is correct
34	Correct	130 ms	235156 KB	Output is correct
35	Correct	130 ms	235256 KB	Output is correct
36	Correct	128 ms	235256 KB	Output is correct
37	Correct	131 ms	235256 KB	Output is correct
38	Correct	133 ms	235272 KB	Output is correct
39	Correct	127 ms	235256 KB	Output is correct
40	Correct	133 ms	235256 KB	Output is correct
41	Correct	136 ms	235256 KB	Output is correct
42	Correct	134 ms	235256 KB	Output is correct
43	Correct	129 ms	235256 KB	Output is correct
44	Correct	128 ms	235260 KB	Output is correct
45	Correct	135 ms	235256 KB	Output is correct
46	Correct	132 ms	235256 KB	Output is correct
47	Correct	127 ms	235256 KB	Output is correct
48	Correct	133 ms	235384 KB	Output is correct
49	Correct	135 ms	235256 KB	Output is correct
50	Correct	131 ms	235248 KB	Output is correct
51	Correct	133 ms	235324 KB	Output is correct

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	184 ms	235148 KB	Output is correct
2	Correct	129 ms	235256 KB	Output is correct
3	Correct	134 ms	235256 KB	Output is correct
4	Correct	130 ms	235128 KB	Output is correct
5	Correct	130 ms	235128 KB	Output is correct
6	Correct	134 ms	235256 KB	Output is correct
7	Correct	130 ms	235128 KB	Output is correct
8	Correct	132 ms	235384 KB	Output is correct
9	Correct	127 ms	235128 KB	Output is correct
10	Correct	135 ms	235128 KB	Output is correct
11	Correct	125 ms	235128 KB	Output is correct
12	Correct	135 ms	235136 KB	Output is correct
13	Correct	134 ms	235256 KB	Output is correct
14	Correct	132 ms	235128 KB	Output is correct
15	Correct	130 ms	235128 KB	Output is correct
16	Correct	129 ms	235232 KB	Output is correct
17	Correct	129 ms	235128 KB	Output is correct
18	Correct	130 ms	235128 KB	Output is correct
19	Correct	129 ms	235128 KB	Output is correct
20	Correct	129 ms	235256 KB	Output is correct
21	Correct	128 ms	235128 KB	Output is correct
22	Correct	132 ms	235256 KB	Output is correct
23	Correct	133 ms	235252 KB	Output is correct
24	Correct	129 ms	235256 KB	Output is correct
25	Correct	127 ms	235260 KB	Output is correct
26	Correct	130 ms	235256 KB	Output is correct
27	Correct	132 ms	235256 KB	Output is correct
28	Correct	130 ms	235232 KB	Output is correct
29	Correct	129 ms	235256 KB	Output is correct
30	Correct	138 ms	235256 KB	Output is correct
31	Correct	129 ms	235256 KB	Output is correct
32	Correct	135 ms	235256 KB	Output is correct
33	Correct	138 ms	235256 KB	Output is correct
34	Correct	130 ms	235156 KB	Output is correct
35	Correct	130 ms	235256 KB	Output is correct
36	Correct	128 ms	235256 KB	Output is correct
37	Correct	131 ms	235256 KB	Output is correct
38	Correct	133 ms	235272 KB	Output is correct
39	Correct	127 ms	235256 KB	Output is correct
40	Correct	133 ms	235256 KB	Output is correct
41	Correct	136 ms	235256 KB	Output is correct
42	Correct	134 ms	235256 KB	Output is correct
43	Correct	129 ms	235256 KB	Output is correct
44	Correct	128 ms	235260 KB	Output is correct
45	Correct	135 ms	235256 KB	Output is correct
46	Correct	132 ms	235256 KB	Output is correct
47	Correct	127 ms	235256 KB	Output is correct
48	Correct	133 ms	235384 KB	Output is correct
49	Correct	135 ms	235256 KB	Output is correct
50	Correct	131 ms	235248 KB	Output is correct
51	Correct	133 ms	235324 KB	Output is correct
52	Correct	314 ms	246184 KB	Output is correct
53	Correct	268 ms	246240 KB	Output is correct
54	Correct	269 ms	246268 KB	Output is correct
55	Execution timed out	212 ms	243012 KB	Time limit exceeded (wall clock)
56	Halted	0 ms	0 KB	-

답안 #200832

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