/**
Elohim Essaim, Elohim Essaim I implore you...
**/
#include <bits/stdc++.h>
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 1e6 + 5;
int n, m, a[N], b[N], p[N], q[N];
long long ans, mx[N * 4], lz[N * 4], inf = 1e18, s[N], t[N], pr1[N], pr2[N];
map < pair<int, int>, long long> mp;
void push(int v, int tl, int tr){
if (lz[v]){
mx[v] += lz[v];
if (tl != tr)
lz[v + v] += lz[v],
lz[v + v + 1] += lz[v];
lz[v] = 0;
}
}
void add (int l, int r, long long val, int v = 1, int tl = 0, int tr = n)
{
push(v, tl, tr);
if (l > tr || tl > r) return;
if (l <= tl && tr <= r)
{
lz[v] = val;
push(v, tl , tr);
return;
}
int tm = (tl + tr) >> 1;
add(l, r, val, v + v, tl, tm);
add(l, r, val, v + v + 1, tm + 1, tr);
mx[v] = max(mx[v + v], mx[v + v + 1]);
}
long long get (int l, int r, int v = 1, int tl = 0, int tr = n)
{
push(v, tl, tr);
if (l > tr || tl > r || l > r)
return -inf;
if (l <= tl && tr <= r)
return mx[v];
int tm = (tl + tr) >> 1;
return max( get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm + 1, tr) );
}
void update (int pos, long long val, int v = 1, int tl = 0, int tr = n)
{
push(v, tl, tr);
if (tl == tr)
mx[v] = max(mx[v], val);
else{
int tm = (tl + tr) >> 1;
if (pos <= tm)
update(pos, val, v + v, tl, tm);
else
update(pos, val, v + v + 1, tm + 1, tr);
mx[v] = max( mx[v + v], mx[v + v + 1] );
}
}
main(){
cin >> n >> m;
for (int i = 1; i <= n; i++){
scanf("%d%lld%d", &a[i], &s[i], &p[i]);
pr1[i] = pr1[i - 1] + a[i];
}
for (int i = 1; i <= m; i++){
scanf("%d%lld%d", &b[i], &t[i], &q[i]);
pr2[i] = pr2[i - 1] + b[i];
}
for (int i = 1; i <= n; i++)
{
if (pr1[i] > s[i]) continue;
ans += p[i];
if ( pr1[i] + pr2[m] <= s[i] ) continue;
int j = upper_bound( pr2 + 1, pr2 + 1 + m, s[i] - pr1[i] ) - pr2 - 1;
mp[ mk(j, -i) ] += p[i];
}
for (int i = 1; i <= m; i++)
{
if (pr2[i] > t[i]) continue;
ans += q[i];
if ( pr2[i] + pr1[n] <= t[i] ) continue;
int j = upper_bound( pr1 + 1, pr1 + 1 + n, t[i] - pr2[i] ) - pr1 - 1;
mp[ mk(i - 1, -j - 1) ] -= q[i];
}
for (auto it : mp)
{
update( -it.fr.sc, get(0, (-it.fr.sc) - 1) );
add( -it.fr.sc, n, it.sc);
}
cout << mx[1] + ans << endl;
}
/**
19
1
18 86 -72
91 85 47
99 53 12
8 83 -9
89 87 -24
73 90 72
25 39 -96
51 10 73
8 23 5
79 5 -76
21 60 4
60 42 26
9 15 18
70 92 -10
90 86 -90
64 36 -69
88 82 66
74 69 25
13 25 14
62 27 93
**/
Compilation message
dishes.cpp:84:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
dishes.cpp: In function 'int main()':
dishes.cpp:89:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%lld%d", &a[i], &s[i], &p[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:94:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%lld%d", &b[i], &t[i], &q[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
443 ms |
32340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
443 ms |
32340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
443 ms |
32340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
