oj.uz

Submission #106907

# Submission time Handle Problem Language Result Execution time Memory
106907 2019-04-20T21:28:45 Z eriksuenderhauf Two Dishes (JOI19_dishes) C++11
100 / 100
 7587 ms 203076 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));
}

// consider the following scenario:
//   x
//  / \
// L   R
// if L is updated and the value of R is not changed with 
// lazy-propagation then the value of x is not set correctly

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) {
	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 = min((m+1),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);
		upd1(0, mx, 1, -y + 1, tmp);
		upd2(0, mx, 1, 0, -y, c);
	}
	prl(ans+qry(0,mx,1,0,mx));
    return 0;
}

Compilation message

dishes.cpp:60:1: warning: multi-line comment [-Wcomment]
 //  / \
 ^
dishes.cpp: In function 'int main()':
dishes.cpp:98: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:100: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:104: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 478 ms 32424 KB Output is correct
2 Correct 442 ms 31352 KB Output is correct
3 Correct 192 ms 9816 KB Output is correct
4 Correct 349 ms 22776 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 420 ms 27640 KB Output is correct
7 Correct 109 ms 5240 KB Output is correct
8 Correct 91 ms 5112 KB Output is correct
9 Correct 182 ms 9720 KB Output is correct
10 Correct 464 ms 30588 KB Output is correct
11 Correct 158 ms 9720 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 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 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 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 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 10 ms 768 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 9 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 385 ms 22628 KB Output is correct
25 Correct 443 ms 30592 KB Output is correct
26 Correct 401 ms 30596 KB Output is correct
27 Correct 442 ms 30604 KB Output is correct
28 Correct 368 ms 24312 KB Output is correct
29 Correct 143 ms 9848 KB Output is correct
30 Correct 1026 ms 42148 KB Output is correct
31 Correct 185 ms 19576 KB Output is correct
32 Correct 129 ms 11384 KB Output is correct
33 Correct 605 ms 30200 KB Output is correct
34 Correct 1044 ms 37496 KB Output is correct
35 Correct 1047 ms 42820 KB Output is correct
36 Correct 998 ms 41844 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 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 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 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 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 10 ms 768 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 9 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 385 ms 22628 KB Output is correct
25 Correct 443 ms 30592 KB Output is correct
26 Correct 401 ms 30596 KB Output is correct
27 Correct 442 ms 30604 KB Output is correct
28 Correct 368 ms 24312 KB Output is correct
29 Correct 143 ms 9848 KB Output is correct
30 Correct 1026 ms 42148 KB Output is correct
31 Correct 185 ms 19576 KB Output is correct
32 Correct 129 ms 11384 KB Output is correct
33 Correct 605 ms 30200 KB Output is correct
34 Correct 1044 ms 37496 KB Output is correct
35 Correct 1047 ms 42820 KB Output is correct
36 Correct 998 ms 41844 KB Output is correct
37 Correct 484 ms 30624 KB Output is correct
38 Correct 543 ms 30476 KB Output is correct
39 Correct 444 ms 30628 KB Output is correct
40 Correct 512 ms 30584 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 1103 ms 42168 KB Output is correct
43 Correct 654 ms 29944 KB Output is correct
44 Correct 870 ms 37272 KB Output is correct
45 Correct 1020 ms 42692 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 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 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 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 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 10 ms 768 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 9 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 385 ms 22628 KB Output is correct
25 Correct 443 ms 30592 KB Output is correct
26 Correct 401 ms 30596 KB Output is correct
27 Correct 442 ms 30604 KB Output is correct
28 Correct 368 ms 24312 KB Output is correct
29 Correct 143 ms 9848 KB Output is correct
30 Correct 1026 ms 42148 KB Output is correct
31 Correct 185 ms 19576 KB Output is correct
32 Correct 129 ms 11384 KB Output is correct
33 Correct 605 ms 30200 KB Output is correct
34 Correct 1044 ms 37496 KB Output is correct
35 Correct 1047 ms 42820 KB Output is correct
36 Correct 998 ms 41844 KB Output is correct
37 Correct 484 ms 30624 KB Output is correct
38 Correct 543 ms 30476 KB Output is correct
39 Correct 444 ms 30628 KB Output is correct
40 Correct 512 ms 30584 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 1103 ms 42168 KB Output is correct
43 Correct 654 ms 29944 KB Output is correct
44 Correct 870 ms 37272 KB Output is correct
45 Correct 1020 ms 42692 KB Output is correct
46 Correct 2278 ms 142756 KB Output is correct
47 Correct 2386 ms 142888 KB Output is correct
48 Correct 2425 ms 142988 KB Output is correct
49 Correct 2755 ms 142728 KB Output is correct
50 Correct 7587 ms 203040 KB Output is correct
51 Correct 4016 ms 136856 KB Output is correct
52 Correct 4868 ms 163580 KB Output is correct
53 Correct 6911 ms 198424 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 32424 KB Output is correct
2 Correct 442 ms 31352 KB Output is correct
3 Correct 192 ms 9816 KB Output is correct
4 Correct 349 ms 22776 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 420 ms 27640 KB Output is correct
7 Correct 109 ms 5240 KB Output is correct
8 Correct 91 ms 5112 KB Output is correct
9 Correct 182 ms 9720 KB Output is correct
10 Correct 464 ms 30588 KB Output is correct
11 Correct 158 ms 9720 KB Output is correct
12 Correct 2 ms 384 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 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 10 ms 768 KB Output is correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 9 ms 768 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 6 ms 768 KB Output is correct
35 Correct 385 ms 22628 KB Output is correct
36 Correct 443 ms 30592 KB Output is correct
37 Correct 401 ms 30596 KB Output is correct
38 Correct 442 ms 30604 KB Output is correct
39 Correct 368 ms 24312 KB Output is correct
40 Correct 143 ms 9848 KB Output is correct
41 Correct 1026 ms 42148 KB Output is correct
42 Correct 185 ms 19576 KB Output is correct
43 Correct 129 ms 11384 KB Output is correct
44 Correct 605 ms 30200 KB Output is correct
45 Correct 1044 ms 37496 KB Output is correct
46 Correct 1047 ms 42820 KB Output is correct
47 Correct 998 ms 41844 KB Output is correct
48 Correct 484 ms 30624 KB Output is correct
49 Correct 543 ms 30476 KB Output is correct
50 Correct 444 ms 30628 KB Output is correct
51 Correct 512 ms 30584 KB Output is correct
52 Correct 3 ms 384 KB Output is correct
53 Correct 1103 ms 42168 KB Output is correct
54 Correct 654 ms 29944 KB Output is correct
55 Correct 870 ms 37272 KB Output is correct
56 Correct 1020 ms 42692 KB Output is correct
57 Correct 471 ms 30476 KB Output is correct
58 Correct 539 ms 30456 KB Output is correct
59 Correct 482 ms 30456 KB Output is correct
60 Correct 432 ms 30548 KB Output is correct
61 Correct 1152 ms 43256 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 1085 ms 42324 KB Output is correct
64 Correct 616 ms 29984 KB Output is correct
65 Correct 836 ms 37168 KB Output is correct
66 Correct 988 ms 41708 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 32424 KB Output is correct
2 Correct 442 ms 31352 KB Output is correct
3 Correct 192 ms 9816 KB Output is correct
4 Correct 349 ms 22776 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 420 ms 27640 KB Output is correct
7 Correct 109 ms 5240 KB Output is correct
8 Correct 91 ms 5112 KB Output is correct
9 Correct 182 ms 9720 KB Output is correct
10 Correct 464 ms 30588 KB Output is correct
11 Correct 158 ms 9720 KB Output is correct
12 Correct 2 ms 384 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 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 10 ms 768 KB Output is correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 9 ms 768 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 6 ms 768 KB Output is correct
35 Correct 385 ms 22628 KB Output is correct
36 Correct 443 ms 30592 KB Output is correct
37 Correct 401 ms 30596 KB Output is correct
38 Correct 442 ms 30604 KB Output is correct
39 Correct 368 ms 24312 KB Output is correct
40 Correct 143 ms 9848 KB Output is correct
41 Correct 1026 ms 42148 KB Output is correct
42 Correct 185 ms 19576 KB Output is correct
43 Correct 129 ms 11384 KB Output is correct
44 Correct 605 ms 30200 KB Output is correct
45 Correct 1044 ms 37496 KB Output is correct
46 Correct 1047 ms 42820 KB Output is correct
47 Correct 998 ms 41844 KB Output is correct
48 Correct 484 ms 30624 KB Output is correct
49 Correct 543 ms 30476 KB Output is correct
50 Correct 444 ms 30628 KB Output is correct
51 Correct 512 ms 30584 KB Output is correct
52 Correct 3 ms 384 KB Output is correct
53 Correct 1103 ms 42168 KB Output is correct
54 Correct 654 ms 29944 KB Output is correct
55 Correct 870 ms 37272 KB Output is correct
56 Correct 1020 ms 42692 KB Output is correct
57 Correct 2278 ms 142756 KB Output is correct
58 Correct 2386 ms 142888 KB Output is correct
59 Correct 2425 ms 142988 KB Output is correct
60 Correct 2755 ms 142728 KB Output is correct
61 Correct 7587 ms 203040 KB Output is correct
62 Correct 4016 ms 136856 KB Output is correct
63 Correct 4868 ms 163580 KB Output is correct
64 Correct 6911 ms 198424 KB Output is correct
65 Correct 471 ms 30476 KB Output is correct
66 Correct 539 ms 30456 KB Output is correct
67 Correct 482 ms 30456 KB Output is correct
68 Correct 432 ms 30548 KB Output is correct
69 Correct 1152 ms 43256 KB Output is correct
70 Correct 2 ms 384 KB Output is correct
71 Correct 1085 ms 42324 KB Output is correct
72 Correct 616 ms 29984 KB Output is correct
73 Correct 836 ms 37168 KB Output is correct
74 Correct 988 ms 41708 KB Output is correct
75 Correct 2501 ms 142980 KB Output is correct
76 Correct 2392 ms 142856 KB Output is correct
77 Correct 2441 ms 142956 KB Output is correct
78 Correct 2512 ms 142924 KB Output is correct
79 Correct 7577 ms 203076 KB Output is correct
80 Correct 3818 ms 136936 KB Output is correct
81 Correct 5171 ms 165140 KB Output is correct
82 Correct 7039 ms 201904 KB Output is correct
83 Correct 6904 ms 194220 KB Output is correct