oj.uz

답안 #106882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106882 2019-04-20T20:00:25 Z eriksuenderhauf Two Dishes (JOI19_dishes) C++11
100 / 100
 7557 ms 203808 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 - 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: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

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 32936 KB Output is correct
2 Correct 518 ms 31864 KB Output is correct
3 Correct 197 ms 10332 KB Output is correct
4 Correct 410 ms 23148 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 400 ms 28068 KB Output is correct
7 Correct 118 ms 5724 KB Output is correct
8 Correct 109 ms 5660 KB Output is correct
9 Correct 218 ms 10232 KB Output is correct
10 Correct 408 ms 31012 KB Output is correct
11 Correct 134 ms 10300 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 25 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 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 428 KB Output is correct
16 Correct 3 ms 412 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 25 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 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 428 KB Output is correct
16 Correct 3 ms 412 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 10 ms 768 KB Output is correct
20 Correct 5 ms 704 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 10 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 25 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 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 428 KB Output is correct
16 Correct 3 ms 412 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 10 ms 768 KB Output is correct
20 Correct 5 ms 704 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 10 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 434 ms 23036 KB Output is correct
25 Correct 383 ms 31092 KB Output is correct
26 Correct 442 ms 31112 KB Output is correct
27 Correct 430 ms 31164 KB Output is correct
28 Correct 430 ms 24924 KB Output is correct
29 Correct 178 ms 10328 KB Output is correct
30 Correct 1095 ms 42756 KB Output is correct
31 Correct 192 ms 20156 KB Output is correct
32 Correct 140 ms 11996 KB Output is correct
33 Correct 660 ms 30632 KB Output is correct
34 Correct 973 ms 38088 KB Output is correct
35 Correct 1111 ms 43424 KB Output is correct
36 Correct 1107 ms 42360 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 25 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 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 428 KB Output is correct
16 Correct 3 ms 412 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 10 ms 768 KB Output is correct
20 Correct 5 ms 704 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 10 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 434 ms 23036 KB Output is correct
25 Correct 383 ms 31092 KB Output is correct
26 Correct 442 ms 31112 KB Output is correct
27 Correct 430 ms 31164 KB Output is correct
28 Correct 430 ms 24924 KB Output is correct
29 Correct 178 ms 10328 KB Output is correct
30 Correct 1095 ms 42756 KB Output is correct
31 Correct 192 ms 20156 KB Output is correct
32 Correct 140 ms 11996 KB Output is correct
33 Correct 660 ms 30632 KB Output is correct
34 Correct 973 ms 38088 KB Output is correct
35 Correct 1111 ms 43424 KB Output is correct
36 Correct 1107 ms 42360 KB Output is correct
37 Correct 428 ms 31084 KB Output is correct
38 Correct 455 ms 31224 KB Output is correct
39 Correct 516 ms 31156 KB Output is correct
40 Correct 537 ms 31288 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1101 ms 42748 KB Output is correct
43 Correct 651 ms 30584 KB Output is correct
44 Correct 911 ms 37624 KB Output is correct
45 Correct 1168 ms 43256 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 25 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 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 428 KB Output is correct
16 Correct 3 ms 412 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 10 ms 768 KB Output is correct
20 Correct 5 ms 704 KB Output is correct
21 Correct 8 ms 768 KB Output is correct
22 Correct 10 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 434 ms 23036 KB Output is correct
25 Correct 383 ms 31092 KB Output is correct
26 Correct 442 ms 31112 KB Output is correct
27 Correct 430 ms 31164 KB Output is correct
28 Correct 430 ms 24924 KB Output is correct
29 Correct 178 ms 10328 KB Output is correct
30 Correct 1095 ms 42756 KB Output is correct
31 Correct 192 ms 20156 KB Output is correct
32 Correct 140 ms 11996 KB Output is correct
33 Correct 660 ms 30632 KB Output is correct
34 Correct 973 ms 38088 KB Output is correct
35 Correct 1111 ms 43424 KB Output is correct
36 Correct 1107 ms 42360 KB Output is correct
37 Correct 428 ms 31084 KB Output is correct
38 Correct 455 ms 31224 KB Output is correct
39 Correct 516 ms 31156 KB Output is correct
40 Correct 537 ms 31288 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1101 ms 42748 KB Output is correct
43 Correct 651 ms 30584 KB Output is correct
44 Correct 911 ms 37624 KB Output is correct
45 Correct 1168 ms 43256 KB Output is correct
46 Correct 2636 ms 143280 KB Output is correct
47 Correct 2467 ms 143212 KB Output is correct
48 Correct 2513 ms 143008 KB Output is correct
49 Correct 2544 ms 143144 KB Output is correct
50 Correct 7557 ms 203444 KB Output is correct
51 Correct 3967 ms 137208 KB Output is correct
52 Correct 5197 ms 164016 KB Output is correct
53 Correct 6655 ms 198488 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 32936 KB Output is correct
2 Correct 518 ms 31864 KB Output is correct
3 Correct 197 ms 10332 KB Output is correct
4 Correct 410 ms 23148 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 400 ms 28068 KB Output is correct
7 Correct 118 ms 5724 KB Output is correct
8 Correct 109 ms 5660 KB Output is correct
9 Correct 218 ms 10232 KB Output is correct
10 Correct 408 ms 31012 KB Output is correct
11 Correct 134 ms 10300 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 25 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 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 428 KB Output is correct
27 Correct 3 ms 412 KB Output is correct
28 Correct 7 ms 768 KB Output is correct
29 Correct 7 ms 768 KB Output is correct
30 Correct 10 ms 768 KB Output is correct
31 Correct 5 ms 704 KB Output is correct
32 Correct 8 ms 768 KB Output is correct
33 Correct 10 ms 768 KB Output is correct
34 Correct 8 ms 768 KB Output is correct
35 Correct 434 ms 23036 KB Output is correct
36 Correct 383 ms 31092 KB Output is correct
37 Correct 442 ms 31112 KB Output is correct
38 Correct 430 ms 31164 KB Output is correct
39 Correct 430 ms 24924 KB Output is correct
40 Correct 178 ms 10328 KB Output is correct
41 Correct 1095 ms 42756 KB Output is correct
42 Correct 192 ms 20156 KB Output is correct
43 Correct 140 ms 11996 KB Output is correct
44 Correct 660 ms 30632 KB Output is correct
45 Correct 973 ms 38088 KB Output is correct
46 Correct 1111 ms 43424 KB Output is correct
47 Correct 1107 ms 42360 KB Output is correct
48 Correct 428 ms 31084 KB Output is correct
49 Correct 455 ms 31224 KB Output is correct
50 Correct 516 ms 31156 KB Output is correct
51 Correct 537 ms 31288 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 1101 ms 42748 KB Output is correct
54 Correct 651 ms 30584 KB Output is correct
55 Correct 911 ms 37624 KB Output is correct
56 Correct 1168 ms 43256 KB Output is correct
57 Correct 443 ms 31280 KB Output is correct
58 Correct 446 ms 31092 KB Output is correct
59 Correct 478 ms 31412 KB Output is correct
60 Correct 432 ms 31096 KB Output is correct
61 Correct 1097 ms 43752 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 1067 ms 42744 KB Output is correct
64 Correct 627 ms 30404 KB Output is correct
65 Correct 821 ms 37592 KB Output is correct
66 Correct 1006 ms 42396 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 471 ms 32936 KB Output is correct
2 Correct 518 ms 31864 KB Output is correct
3 Correct 197 ms 10332 KB Output is correct
4 Correct 410 ms 23148 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 400 ms 28068 KB Output is correct
7 Correct 118 ms 5724 KB Output is correct
8 Correct 109 ms 5660 KB Output is correct
9 Correct 218 ms 10232 KB Output is correct
10 Correct 408 ms 31012 KB Output is correct
11 Correct 134 ms 10300 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 25 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 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 428 KB Output is correct
27 Correct 3 ms 412 KB Output is correct
28 Correct 7 ms 768 KB Output is correct
29 Correct 7 ms 768 KB Output is correct
30 Correct 10 ms 768 KB Output is correct
31 Correct 5 ms 704 KB Output is correct
32 Correct 8 ms 768 KB Output is correct
33 Correct 10 ms 768 KB Output is correct
34 Correct 8 ms 768 KB Output is correct
35 Correct 434 ms 23036 KB Output is correct
36 Correct 383 ms 31092 KB Output is correct
37 Correct 442 ms 31112 KB Output is correct
38 Correct 430 ms 31164 KB Output is correct
39 Correct 430 ms 24924 KB Output is correct
40 Correct 178 ms 10328 KB Output is correct
41 Correct 1095 ms 42756 KB Output is correct
42 Correct 192 ms 20156 KB Output is correct
43 Correct 140 ms 11996 KB Output is correct
44 Correct 660 ms 30632 KB Output is correct
45 Correct 973 ms 38088 KB Output is correct
46 Correct 1111 ms 43424 KB Output is correct
47 Correct 1107 ms 42360 KB Output is correct
48 Correct 428 ms 31084 KB Output is correct
49 Correct 455 ms 31224 KB Output is correct
50 Correct 516 ms 31156 KB Output is correct
51 Correct 537 ms 31288 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 1101 ms 42748 KB Output is correct
54 Correct 651 ms 30584 KB Output is correct
55 Correct 911 ms 37624 KB Output is correct
56 Correct 1168 ms 43256 KB Output is correct
57 Correct 2636 ms 143280 KB Output is correct
58 Correct 2467 ms 143212 KB Output is correct
59 Correct 2513 ms 143008 KB Output is correct
60 Correct 2544 ms 143144 KB Output is correct
61 Correct 7557 ms 203444 KB Output is correct
62 Correct 3967 ms 137208 KB Output is correct
63 Correct 5197 ms 164016 KB Output is correct
64 Correct 6655 ms 198488 KB Output is correct
65 Correct 443 ms 31280 KB Output is correct
66 Correct 446 ms 31092 KB Output is correct
67 Correct 478 ms 31412 KB Output is correct
68 Correct 432 ms 31096 KB Output is correct
69 Correct 1097 ms 43752 KB Output is correct
70 Correct 2 ms 384 KB Output is correct
71 Correct 1067 ms 42744 KB Output is correct
72 Correct 627 ms 30404 KB Output is correct
73 Correct 821 ms 37592 KB Output is correct
74 Correct 1006 ms 42396 KB Output is correct
75 Correct 2513 ms 143460 KB Output is correct
76 Correct 2343 ms 143532 KB Output is correct
77 Correct 2461 ms 143608 KB Output is correct
78 Correct 2535 ms 143412 KB Output is correct
79 Correct 7273 ms 203808 KB Output is correct
80 Correct 3927 ms 137656 KB Output is correct
81 Correct 5539 ms 165824 KB Output is correct
82 Correct 7365 ms 202372 KB Output is correct
83 Correct 6965 ms 194628 KB Output is correct