Submission #145329

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
145329	2019-08-19T15:41:35 Z	gs18103	코알라 (JOI13_koala)	C++14	100 / 100	122 ms	11904 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);
	num.push_back(0);
	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	9 ms	6652 KB	Output is correct
2	Correct	8 ms	6648 KB	Output is correct
3	Correct	8 ms	6904 KB	Output is correct
4	Correct	9 ms	6648 KB	Output is correct
5	Correct	7 ms	6664 KB	Output is correct
6	Correct	7 ms	6776 KB	Output is correct
7	Correct	7 ms	6652 KB	Output is correct
8	Correct	7 ms	6776 KB	Output is correct
9	Correct	8 ms	6904 KB	Output is correct
10	Correct	12 ms	6776 KB	Output is correct

Subtask #2

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	99 ms	9932 KB	Output is correct
2	Correct	96 ms	11596 KB	Output is correct
3	Correct	38 ms	10100 KB	Output is correct
4	Correct	89 ms	11904 KB	Output is correct
5	Correct	53 ms	9840 KB	Output is correct
6	Correct	34 ms	8564 KB	Output is correct
7	Correct	69 ms	10836 KB	Output is correct

Subtask #3

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	122 ms	10092 KB	Output is correct
2	Correct	117 ms	11760 KB	Output is correct
3	Correct	118 ms	11800 KB	Output is correct
4	Correct	98 ms	11756 KB	Output is correct
5	Correct	73 ms	9840 KB	Output is correct
6	Correct	57 ms	9076 KB	Output is correct