oj.uz

Submission #106877

# Submission time Handle Problem Language Result Execution time Memory
106877 2019-04-20T19:43:20 Z eriksuenderhauf Two Dishes (JOI19_dishes) C++11
100 / 100
 8215 ms 205044 KB 
//#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) {
	seg[k] += lazy[k];
	prop(l,r,k);
	if (a < l || r < a) return;
	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) {
	seg[k] += lazy[k];
	prop(l,r,k);
	if (b < l || r < a || a > b) return;
	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]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 30940 KB Output is correct
2 Correct 492 ms 30072 KB Output is correct
3 Correct 180 ms 9820 KB Output is correct
4 Correct 355 ms 21624 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 438 ms 26232 KB Output is correct
7 Correct 83 ms 5260 KB Output is correct
8 Correct 90 ms 5116 KB Output is correct
9 Correct 172 ms 9720 KB Output is correct
10 Correct 431 ms 29076 KB Output is correct
11 Correct 128 ms 9848 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 8 ms 896 KB Output is correct
20 Correct 9 ms 896 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 8 ms 1024 KB Output is correct
23 Correct 8 ms 896 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 8 ms 896 KB Output is correct
20 Correct 9 ms 896 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 8 ms 1024 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 439 ms 25820 KB Output is correct
25 Correct 383 ms 32224 KB Output is correct
26 Correct 402 ms 32248 KB Output is correct
27 Correct 401 ms 32252 KB Output is correct
28 Correct 396 ms 26244 KB Output is correct
29 Correct 144 ms 13048 KB Output is correct
30 Correct 1086 ms 43768 KB Output is correct
31 Correct 212 ms 21236 KB Output is correct
32 Correct 200 ms 14684 KB Output is correct
33 Correct 774 ms 31976 KB Output is correct
34 Correct 932 ms 38884 KB Output is correct
35 Correct 1198 ms 44384 KB Output is correct
36 Correct 1353 ms 43412 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 8 ms 896 KB Output is correct
20 Correct 9 ms 896 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 8 ms 1024 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 439 ms 25820 KB Output is correct
25 Correct 383 ms 32224 KB Output is correct
26 Correct 402 ms 32248 KB Output is correct
27 Correct 401 ms 32252 KB Output is correct
28 Correct 396 ms 26244 KB Output is correct
29 Correct 144 ms 13048 KB Output is correct
30 Correct 1086 ms 43768 KB Output is correct
31 Correct 212 ms 21236 KB Output is correct
32 Correct 200 ms 14684 KB Output is correct
33 Correct 774 ms 31976 KB Output is correct
34 Correct 932 ms 38884 KB Output is correct
35 Correct 1198 ms 44384 KB Output is correct
36 Correct 1353 ms 43412 KB Output is correct
37 Correct 492 ms 32680 KB Output is correct
38 Correct 570 ms 32732 KB Output is correct
39 Correct 441 ms 32260 KB Output is correct
40 Correct 447 ms 32248 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 1182 ms 44664 KB Output is correct
43 Correct 735 ms 31992 KB Output is correct
44 Correct 860 ms 38904 KB Output is correct
45 Correct 1054 ms 44172 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 8 ms 896 KB Output is correct
20 Correct 9 ms 896 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 8 ms 1024 KB Output is correct
23 Correct 8 ms 896 KB Output is correct
24 Correct 439 ms 25820 KB Output is correct
25 Correct 383 ms 32224 KB Output is correct
26 Correct 402 ms 32248 KB Output is correct
27 Correct 401 ms 32252 KB Output is correct
28 Correct 396 ms 26244 KB Output is correct
29 Correct 144 ms 13048 KB Output is correct
30 Correct 1086 ms 43768 KB Output is correct
31 Correct 212 ms 21236 KB Output is correct
32 Correct 200 ms 14684 KB Output is correct
33 Correct 774 ms 31976 KB Output is correct
34 Correct 932 ms 38884 KB Output is correct
35 Correct 1198 ms 44384 KB Output is correct
36 Correct 1353 ms 43412 KB Output is correct
37 Correct 492 ms 32680 KB Output is correct
38 Correct 570 ms 32732 KB Output is correct
39 Correct 441 ms 32260 KB Output is correct
40 Correct 447 ms 32248 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 1182 ms 44664 KB Output is correct
43 Correct 735 ms 31992 KB Output is correct
44 Correct 860 ms 38904 KB Output is correct
45 Correct 1054 ms 44172 KB Output is correct
46 Correct 2636 ms 143408 KB Output is correct
47 Correct 2592 ms 143304 KB Output is correct
48 Correct 2856 ms 143340 KB Output is correct
49 Correct 2690 ms 143112 KB Output is correct
50 Correct 8018 ms 205044 KB Output is correct
51 Correct 4282 ms 137336 KB Output is correct
52 Correct 5677 ms 160392 KB Output is correct
53 Correct 7503 ms 198668 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 30940 KB Output is correct
2 Correct 492 ms 30072 KB Output is correct
3 Correct 180 ms 9820 KB Output is correct
4 Correct 355 ms 21624 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 438 ms 26232 KB Output is correct
7 Correct 83 ms 5260 KB Output is correct
8 Correct 90 ms 5116 KB Output is correct
9 Correct 172 ms 9720 KB Output is correct
10 Correct 431 ms 29076 KB Output is correct
11 Correct 128 ms 9848 KB Output is correct
12 Correct 3 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 3 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 8 ms 896 KB Output is correct
31 Correct 9 ms 896 KB Output is correct
32 Correct 8 ms 1024 KB Output is correct
33 Correct 8 ms 1024 KB Output is correct
34 Correct 8 ms 896 KB Output is correct
35 Correct 439 ms 25820 KB Output is correct
36 Correct 383 ms 32224 KB Output is correct
37 Correct 402 ms 32248 KB Output is correct
38 Correct 401 ms 32252 KB Output is correct
39 Correct 396 ms 26244 KB Output is correct
40 Correct 144 ms 13048 KB Output is correct
41 Correct 1086 ms 43768 KB Output is correct
42 Correct 212 ms 21236 KB Output is correct
43 Correct 200 ms 14684 KB Output is correct
44 Correct 774 ms 31976 KB Output is correct
45 Correct 932 ms 38884 KB Output is correct
46 Correct 1198 ms 44384 KB Output is correct
47 Correct 1353 ms 43412 KB Output is correct
48 Correct 492 ms 32680 KB Output is correct
49 Correct 570 ms 32732 KB Output is correct
50 Correct 441 ms 32260 KB Output is correct
51 Correct 447 ms 32248 KB Output is correct
52 Correct 2 ms 512 KB Output is correct
53 Correct 1182 ms 44664 KB Output is correct
54 Correct 735 ms 31992 KB Output is correct
55 Correct 860 ms 38904 KB Output is correct
56 Correct 1054 ms 44172 KB Output is correct
57 Correct 450 ms 31352 KB Output is correct
58 Correct 478 ms 31464 KB Output is correct
59 Correct 484 ms 30824 KB Output is correct
60 Correct 494 ms 30840 KB Output is correct
61 Correct 1203 ms 43396 KB Output is correct
62 Correct 2 ms 640 KB Output is correct
63 Correct 1114 ms 42620 KB Output is correct
64 Correct 696 ms 29944 KB Output is correct
65 Correct 934 ms 37624 KB Output is correct
66 Correct 1047 ms 41976 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 30940 KB Output is correct
2 Correct 492 ms 30072 KB Output is correct
3 Correct 180 ms 9820 KB Output is correct
4 Correct 355 ms 21624 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 438 ms 26232 KB Output is correct
7 Correct 83 ms 5260 KB Output is correct
8 Correct 90 ms 5116 KB Output is correct
9 Correct 172 ms 9720 KB Output is correct
10 Correct 431 ms 29076 KB Output is correct
11 Correct 128 ms 9848 KB Output is correct
12 Correct 3 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 3 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 8 ms 896 KB Output is correct
31 Correct 9 ms 896 KB Output is correct
32 Correct 8 ms 1024 KB Output is correct
33 Correct 8 ms 1024 KB Output is correct
34 Correct 8 ms 896 KB Output is correct
35 Correct 439 ms 25820 KB Output is correct
36 Correct 383 ms 32224 KB Output is correct
37 Correct 402 ms 32248 KB Output is correct
38 Correct 401 ms 32252 KB Output is correct
39 Correct 396 ms 26244 KB Output is correct
40 Correct 144 ms 13048 KB Output is correct
41 Correct 1086 ms 43768 KB Output is correct
42 Correct 212 ms 21236 KB Output is correct
43 Correct 200 ms 14684 KB Output is correct
44 Correct 774 ms 31976 KB Output is correct
45 Correct 932 ms 38884 KB Output is correct
46 Correct 1198 ms 44384 KB Output is correct
47 Correct 1353 ms 43412 KB Output is correct
48 Correct 492 ms 32680 KB Output is correct
49 Correct 570 ms 32732 KB Output is correct
50 Correct 441 ms 32260 KB Output is correct
51 Correct 447 ms 32248 KB Output is correct
52 Correct 2 ms 512 KB Output is correct
53 Correct 1182 ms 44664 KB Output is correct
54 Correct 735 ms 31992 KB Output is correct
55 Correct 860 ms 38904 KB Output is correct
56 Correct 1054 ms 44172 KB Output is correct
57 Correct 2636 ms 143408 KB Output is correct
58 Correct 2592 ms 143304 KB Output is correct
59 Correct 2856 ms 143340 KB Output is correct
60 Correct 2690 ms 143112 KB Output is correct
61 Correct 8018 ms 205044 KB Output is correct
62 Correct 4282 ms 137336 KB Output is correct
63 Correct 5677 ms 160392 KB Output is correct
64 Correct 7503 ms 198668 KB Output is correct
65 Correct 450 ms 31352 KB Output is correct
66 Correct 478 ms 31464 KB Output is correct
67 Correct 484 ms 30824 KB Output is correct
68 Correct 494 ms 30840 KB Output is correct
69 Correct 1203 ms 43396 KB Output is correct
70 Correct 2 ms 640 KB Output is correct
71 Correct 1114 ms 42620 KB Output is correct
72 Correct 696 ms 29944 KB Output is correct
73 Correct 934 ms 37624 KB Output is correct
74 Correct 1047 ms 41976 KB Output is correct
75 Correct 2520 ms 144608 KB Output is correct
76 Correct 2446 ms 144504 KB Output is correct
77 Correct 2567 ms 144412 KB Output is correct
78 Correct 2725 ms 144448 KB Output is correct
79 Correct 8215 ms 204428 KB Output is correct
80 Correct 3891 ms 135988 KB Output is correct
81 Correct 5062 ms 166524 KB Output is correct
82 Correct 7243 ms 202872 KB Output is correct
83 Correct 7238 ms 195392 KB Output is correct