//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
ll a[MAXN], b[MAXN];
ll s[MAXN], p[MAXN], q[MAXN], t[MAXN];
map<pii,ll> pts;
ll seg[MAXN*4], lazy[MAXN*4];
void prop(int l, int r, int k) {
if (l != r) {
lazy[k*2]+=lazy[k];
lazy[k*2+1]+=lazy[k];
}
lazy[k] = 0;
}
ll qry(int l, int r, int k, int a, int b) {
if (r < a || b < l || a > b) return -INF;
seg[k] += lazy[k];
prop(l,r,k);
if (a <= l && r <= b) return seg[k];
int m = (l + r) / 2;
return max(qry(l,m,k*2,a,b),qry(m+1,r,k*2+1,a,b));
}
void upd1(int l, int r, int k, int a, ll v) {
if (a < l || r < a) return;
seg[k] += lazy[k];
prop(l,r,k);
if (a <= l && r <= a) {
seg[k] = max(seg[k],v);
return;
}
int m = (l + r) / 2;
upd1(l, m, k*2, a, v);
upd1(m+1, r, k*2+1, a, v);
seg[k] = max(seg[k*2],seg[k*2+1]);
}
void upd2(int l, int r, int k, int a, int b, ll v) {
if (b < l || r < a || a > b) return;
seg[k] += lazy[k];
prop(l,r,k);
if (a <= l && r <= b) {
seg[k] += v;
lazy[k] = v;
prop(l, r, k);
return;
}
int m = (l + r) / 2;
upd2(l, m, k*2, a, b, v);
upd2(m+1, r, k*2+1, a, b, v);
seg[k] = max(seg[k*2],seg[k*2+1]);
}
int main() {
int n, m;
ll ans = 0;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld %lld %lld", &a[i], &s[i], &p[i]);
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
scanf("%lld %lld %lld", &b[i], &t[i], &q[i]);
b[i] += b[i - 1];
}
for (int i = 1; i <= n; i++) {
if (a[i] > s[i]) continue;
if (a[i] + b[m] <= s[i]) {
ans += p[i];
continue;
}
int ind = lower_bound(b+1, b+1 + m, s[i]-a[i]+1) - b-1;
pts[{i-1, -(ind+1)}] += p[i];
}
for (int i = 1; i <= m; i++) {
if (b[i] > t[i]) continue;
if (b[i] + a[n] <= t[i]) {
ans += q[i];
continue;
}
int ind = lower_bound(a+1, a+1 + n, t[i]-b[i]+1) - a-1;
ans += q[i];
pts[{ind, -i}] -= q[i];
}
int mx = 2*MAXN-1;
for (auto &it: pts) {
int x, y;
tie(x, y) = it.fi;
ll c = it.se;
ll tmp = qry(0, mx, 1, 0, -y - 1);
upd1(0, mx, 1, -y, tmp);
upd2(0, mx, 1, 0, -y - 1, c);
}
prl(ans+qry(0,mx,1,0,mx));
return 0;
}
Compilation message
dishes.cpp: In function 'int main()':
dishes.cpp:91:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &m);
~~~~~^~~~~~~~~~~~~~~~~
dishes.cpp:93:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld %lld", &a[i], &s[i], &p[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:97:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld %lld", &b[i], &t[i], &q[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
488 ms |
30840 KB |
Output is correct |
2 |
Correct |
477 ms |
29992 KB |
Output is correct |
3 |
Correct |
201 ms |
9848 KB |
Output is correct |
4 |
Correct |
422 ms |
21780 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
482 ms |
26332 KB |
Output is correct |
7 |
Correct |
148 ms |
5188 KB |
Output is correct |
8 |
Correct |
127 ms |
5160 KB |
Output is correct |
9 |
Correct |
203 ms |
9932 KB |
Output is correct |
10 |
Correct |
425 ms |
29020 KB |
Output is correct |
11 |
Correct |
136 ms |
10004 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
3 ms |
512 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
3 ms |
512 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
3 ms |
512 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
3 ms |
512 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
512 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
3 ms |
512 KB |
Output is correct |
8 |
Correct |
3 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
512 KB |
Output is correct |
10 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
488 ms |
30840 KB |
Output is correct |
2 |
Correct |
477 ms |
29992 KB |
Output is correct |
3 |
Correct |
201 ms |
9848 KB |
Output is correct |
4 |
Correct |
422 ms |
21780 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
482 ms |
26332 KB |
Output is correct |
7 |
Correct |
148 ms |
5188 KB |
Output is correct |
8 |
Correct |
127 ms |
5160 KB |
Output is correct |
9 |
Correct |
203 ms |
9932 KB |
Output is correct |
10 |
Correct |
425 ms |
29020 KB |
Output is correct |
11 |
Correct |
136 ms |
10004 KB |
Output is correct |
12 |
Correct |
2 ms |
512 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
2 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
512 KB |
Output is correct |
16 |
Correct |
2 ms |
512 KB |
Output is correct |
17 |
Correct |
2 ms |
512 KB |
Output is correct |
18 |
Correct |
3 ms |
512 KB |
Output is correct |
19 |
Correct |
3 ms |
512 KB |
Output is correct |
20 |
Correct |
2 ms |
512 KB |
Output is correct |
21 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
488 ms |
30840 KB |
Output is correct |
2 |
Correct |
477 ms |
29992 KB |
Output is correct |
3 |
Correct |
201 ms |
9848 KB |
Output is correct |
4 |
Correct |
422 ms |
21780 KB |
Output is correct |
5 |
Correct |
2 ms |
512 KB |
Output is correct |
6 |
Correct |
482 ms |
26332 KB |
Output is correct |
7 |
Correct |
148 ms |
5188 KB |
Output is correct |
8 |
Correct |
127 ms |
5160 KB |
Output is correct |
9 |
Correct |
203 ms |
9932 KB |
Output is correct |
10 |
Correct |
425 ms |
29020 KB |
Output is correct |
11 |
Correct |
136 ms |
10004 KB |
Output is correct |
12 |
Correct |
2 ms |
512 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
2 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
512 KB |
Output is correct |
16 |
Correct |
2 ms |
512 KB |
Output is correct |
17 |
Correct |
2 ms |
512 KB |
Output is correct |
18 |
Correct |
3 ms |
512 KB |
Output is correct |
19 |
Correct |
3 ms |
512 KB |
Output is correct |
20 |
Correct |
2 ms |
512 KB |
Output is correct |
21 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |