Submission #145321

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
145321	2019-08-19T15:11:46 Z	gs18103	코알라 (JOI13_koala)	C++14	70 / 100	123 ms	11888 KB

koala

#include <bits/stdc++.h>
#define LINF 1000000000000000000LL

using namespace std;
typedef long long ll;

ll t[101010];
ll tree[804040], b[101010], dp[101010];
vector <ll> num;

ll update(ll node, ll s, ll e, ll k, ll val) {
	if(s == e) return tree[node] = max(tree[node], val);
	ll m = (s+e)>>1;
	if(k <= m) tree[node] = max(tree[node*2+1], update(node*2, s, m, k, val));
	else tree[node] = max(tree[node*2], update(node*2+1, m+1, e, k, val));
	return tree[node];
}

ll cal(ll node, ll s, ll e, ll l, ll r) {
	if(s > r || e < l) return -LINF;
	if(s >= l && e <= r) return tree[node];
	ll m = (s+e)>>1;
	return max(cal(node*2, s, m, l, r), cal(node*2+1, m+1, e, l, r));
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);

	ll K, M, D, n;
	ll A;
	cin >> K >> M >> D >> A >> n;
	M -= K;
	for(ll i = 1; i <= n; i++) {
		cin >> t[i] >> b[i];
		t[i] -= K;
		num.push_back(t[i] % D);
	}
	num.push_back(M % D);
	t[n+1] = M;
	sort(num.begin(), num.end());
	for(ll i = 0; i < 804040; i++) tree[i] = -LINF;
	update(1, 0, num.size()-1, 0, 0LL);
	for(ll i = 1; i <= n+1; i++) {
		ll k = lower_bound(num.begin(), num.end(), t[i] % D) - num.begin();
		dp[i] = max(cal(1, 0, num.size()-1, 0, k-1) - A, cal(1, 0, num.size()-1, k, num.size()-1)) + b[i];
		update(1, 0, num.size()-1, k, dp[i]);
	}
	cout << dp[n+1] - A * (M / D);
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	6776 KB	Output is correct
2	Correct	8 ms	6648 KB	Output is correct
3	Correct	8 ms	6776 KB	Output is correct
4	Correct	7 ms	6648 KB	Output is correct
5	Correct	9 ms	6648 KB	Output is correct
6	Correct	8 ms	6748 KB	Output is correct
7	Correct	7 ms	6648 KB	Output is correct
8	Correct	8 ms	6776 KB	Output is correct
9	Correct	8 ms	6648 KB	Output is correct
10	Correct	8 ms	6648 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	99 ms	11756 KB	Output is correct
2	Correct	94 ms	11480 KB	Output is correct
3	Correct	38 ms	10100 KB	Output is correct
4	Correct	88 ms	11756 KB	Output is correct
5	Correct	53 ms	9844 KB	Output is correct
6	Correct	35 ms	8560 KB	Output is correct
7	Incorrect	45 ms	10864 KB	Output isn't correct

Subtask #3

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	123 ms	11760 KB	Output is correct
2	Correct	121 ms	11812 KB	Output is correct
3	Correct	107 ms	11760 KB	Output is correct
4	Correct	97 ms	11888 KB	Output is correct
5	Correct	73 ms	9972 KB	Output is correct
6	Correct	56 ms	9204 KB	Output is correct