# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
145300 |
2019-08-19T14:24:40 Z |
gs18103 |
코알라 (JOI13_koala) |
C++14 |
|
275 ms |
10352 KB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define LINF 1000000000000000000LL
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pll;
int t[101010];
ll b[101010], tree[808080];
ll update(int node, int s, int e, int k, ll val) {
if(s == e) return tree[node] = max(tree[node], val);
int m = (s + e) >> 1;
if(k <= m) return tree[node] = max(tree[node*2+1], update(node*2, s, m, k, val));
else return tree[node] = max(tree[node*2], update(node*2+1, m+1, e, k, val));
}
ll cal(int node, int s, int e, int l, int r) {
if(s > r || e < l) return -LINF;
if(s >= l && e <= r) return tree[node];
int m = (s + e) / 2;
return max(cal(node*2, s, m, l, r), cal(node*2+1, m+1, e, l, r));
}
vector <int> num;
int main() {
int K, m, d, n;
ll a;
cin >> K >> m >> d >> a >> n;
for(int i = 1; i <= n; i++) {
cin >> t[i] >> b[i];
t[i] -= K;
num.eb(t[i]%d);
}
num.eb((m-K)%d);
sort(all(num));
num.erase(unique(all(num)), num.end());
for(int i = 0; i < 808080; i++) {
tree[i] = -LINF;
}
update(1, 0, num.size()-1, 0, 0LL);
for(int i = 1; i < num.size(); i++) {
update(1, 0, num.size()-1, i, -a);
}
for(int i = 1; i <= n; i++) {
int k = lower_bound(all(num), t[i]%d) - num.begin();
ll val = max(cal(1, 0, num.size()-1, k, num.size()-1), cal(1, 0, num.size()-1, 0, k-1) - a) + b[i];
update(1, 0, num.size()-1, k, val);
update(1, 0, num.size()-1, num.size()-1, val - a);
}
int k = lower_bound(all(num), (m-K)%d) - num.begin();
cout << cal(1, 0, num.size()-1, k, num.size()-1) - a * ((ll)(m - K) / d);
return 0;
}
Compilation message
koala.cpp: In function 'int main()':
koala.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 1; i < num.size(); i++) {
~~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
6648 KB |
Output is correct |
2 |
Correct |
9 ms |
6776 KB |
Output is correct |
3 |
Correct |
9 ms |
6672 KB |
Output is correct |
4 |
Correct |
8 ms |
6648 KB |
Output is correct |
5 |
Correct |
8 ms |
6648 KB |
Output is correct |
6 |
Correct |
8 ms |
6620 KB |
Output is correct |
7 |
Correct |
7 ms |
6648 KB |
Output is correct |
8 |
Correct |
9 ms |
6644 KB |
Output is correct |
9 |
Correct |
9 ms |
6648 KB |
Output is correct |
10 |
Correct |
9 ms |
6648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
179 ms |
10224 KB |
Output is correct |
2 |
Correct |
162 ms |
9964 KB |
Output is correct |
3 |
Correct |
103 ms |
9076 KB |
Output is correct |
4 |
Correct |
173 ms |
10200 KB |
Output is correct |
5 |
Correct |
108 ms |
8820 KB |
Output is correct |
6 |
Correct |
67 ms |
8052 KB |
Output is correct |
7 |
Incorrect |
100 ms |
9300 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
264 ms |
10260 KB |
Output is correct |
2 |
Correct |
275 ms |
10244 KB |
Output is correct |
3 |
Correct |
264 ms |
10352 KB |
Output is correct |
4 |
Correct |
237 ms |
10300 KB |
Output is correct |
5 |
Correct |
155 ms |
8948 KB |
Output is correct |
6 |
Correct |
117 ms |
8420 KB |
Output is correct |