oj.uz

답안 #106878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106878 2019-04-20T19:47:25 Z eriksuenderhauf Two Dishes (JOI19_dishes) C++11
100 / 100
 7919 ms 203732 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 = min(2*(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: 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

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 33556 KB Output is correct
2 Correct 441 ms 32608 KB Output is correct
3 Correct 177 ms 11000 KB Output is correct
4 Correct 435 ms 23968 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 507 ms 28764 KB Output is correct
7 Correct 92 ms 6392 KB Output is correct
8 Correct 84 ms 6264 KB Output is correct
9 Correct 179 ms 11128 KB Output is correct
10 Correct 390 ms 31776 KB Output is correct
11 Correct 125 ms 11000 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 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 3 ms 384 KB Output is correct
5 Correct 2 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 2 ms 384 KB Output is correct
11 Correct 2 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 2 ms 384 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 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 3 ms 384 KB Output is correct
5 Correct 2 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 2 ms 384 KB Output is correct
11 Correct 2 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 2 ms 384 KB Output is correct
17 Correct 5 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 12 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 7 ms 896 KB Output is correct
23 Correct 6 ms 896 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 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 3 ms 384 KB Output is correct
5 Correct 2 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 2 ms 384 KB Output is correct
11 Correct 2 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 2 ms 384 KB Output is correct
17 Correct 5 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 12 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 7 ms 896 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 422 ms 23568 KB Output is correct
25 Correct 390 ms 31912 KB Output is correct
26 Correct 413 ms 31864 KB Output is correct
27 Correct 463 ms 31864 KB Output is correct
28 Correct 405 ms 25652 KB Output is correct
29 Correct 151 ms 11128 KB Output is correct
30 Correct 1268 ms 43384 KB Output is correct
31 Correct 206 ms 20824 KB Output is correct
32 Correct 127 ms 12536 KB Output is correct
33 Correct 559 ms 31352 KB Output is correct
34 Correct 900 ms 38640 KB Output is correct
35 Correct 1093 ms 43944 KB Output is correct
36 Correct 999 ms 43148 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 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 3 ms 384 KB Output is correct
5 Correct 2 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 2 ms 384 KB Output is correct
11 Correct 2 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 2 ms 384 KB Output is correct
17 Correct 5 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 12 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 7 ms 896 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 422 ms 23568 KB Output is correct
25 Correct 390 ms 31912 KB Output is correct
26 Correct 413 ms 31864 KB Output is correct
27 Correct 463 ms 31864 KB Output is correct
28 Correct 405 ms 25652 KB Output is correct
29 Correct 151 ms 11128 KB Output is correct
30 Correct 1268 ms 43384 KB Output is correct
31 Correct 206 ms 20824 KB Output is correct
32 Correct 127 ms 12536 KB Output is correct
33 Correct 559 ms 31352 KB Output is correct
34 Correct 900 ms 38640 KB Output is correct
35 Correct 1093 ms 43944 KB Output is correct
36 Correct 999 ms 43148 KB Output is correct
37 Correct 439 ms 31724 KB Output is correct
38 Correct 411 ms 31836 KB Output is correct
39 Correct 482 ms 31940 KB Output is correct
40 Correct 446 ms 31988 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1300 ms 43468 KB Output is correct
43 Correct 706 ms 31260 KB Output is correct
44 Correct 923 ms 38368 KB Output is correct
45 Correct 1151 ms 44080 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 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 3 ms 384 KB Output is correct
5 Correct 2 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 2 ms 384 KB Output is correct
11 Correct 2 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 2 ms 384 KB Output is correct
17 Correct 5 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 12 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 7 ms 896 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 422 ms 23568 KB Output is correct
25 Correct 390 ms 31912 KB Output is correct
26 Correct 413 ms 31864 KB Output is correct
27 Correct 463 ms 31864 KB Output is correct
28 Correct 405 ms 25652 KB Output is correct
29 Correct 151 ms 11128 KB Output is correct
30 Correct 1268 ms 43384 KB Output is correct
31 Correct 206 ms 20824 KB Output is correct
32 Correct 127 ms 12536 KB Output is correct
33 Correct 559 ms 31352 KB Output is correct
34 Correct 900 ms 38640 KB Output is correct
35 Correct 1093 ms 43944 KB Output is correct
36 Correct 999 ms 43148 KB Output is correct
37 Correct 439 ms 31724 KB Output is correct
38 Correct 411 ms 31836 KB Output is correct
39 Correct 482 ms 31940 KB Output is correct
40 Correct 446 ms 31988 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1300 ms 43468 KB Output is correct
43 Correct 706 ms 31260 KB Output is correct
44 Correct 923 ms 38368 KB Output is correct
45 Correct 1151 ms 44080 KB Output is correct
46 Correct 2488 ms 143424 KB Output is correct
47 Correct 2611 ms 143628 KB Output is correct
48 Correct 2554 ms 143456 KB Output is correct
49 Correct 2592 ms 143320 KB Output is correct
50 Correct 7905 ms 203380 KB Output is correct
51 Correct 4038 ms 137384 KB Output is correct
52 Correct 5451 ms 164176 KB Output is correct
53 Correct 7538 ms 198648 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 33556 KB Output is correct
2 Correct 441 ms 32608 KB Output is correct
3 Correct 177 ms 11000 KB Output is correct
4 Correct 435 ms 23968 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 507 ms 28764 KB Output is correct
7 Correct 92 ms 6392 KB Output is correct
8 Correct 84 ms 6264 KB Output is correct
9 Correct 179 ms 11128 KB Output is correct
10 Correct 390 ms 31776 KB Output is correct
11 Correct 125 ms 11000 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 3 ms 384 KB Output is correct
16 Correct 2 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 2 ms 384 KB Output is correct
22 Correct 2 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 2 ms 384 KB Output is correct
28 Correct 5 ms 768 KB Output is correct
29 Correct 5 ms 768 KB Output is correct
30 Correct 12 ms 896 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 6 ms 768 KB Output is correct
33 Correct 7 ms 896 KB Output is correct
34 Correct 6 ms 896 KB Output is correct
35 Correct 422 ms 23568 KB Output is correct
36 Correct 390 ms 31912 KB Output is correct
37 Correct 413 ms 31864 KB Output is correct
38 Correct 463 ms 31864 KB Output is correct
39 Correct 405 ms 25652 KB Output is correct
40 Correct 151 ms 11128 KB Output is correct
41 Correct 1268 ms 43384 KB Output is correct
42 Correct 206 ms 20824 KB Output is correct
43 Correct 127 ms 12536 KB Output is correct
44 Correct 559 ms 31352 KB Output is correct
45 Correct 900 ms 38640 KB Output is correct
46 Correct 1093 ms 43944 KB Output is correct
47 Correct 999 ms 43148 KB Output is correct
48 Correct 439 ms 31724 KB Output is correct
49 Correct 411 ms 31836 KB Output is correct
50 Correct 482 ms 31940 KB Output is correct
51 Correct 446 ms 31988 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 1300 ms 43468 KB Output is correct
54 Correct 706 ms 31260 KB Output is correct
55 Correct 923 ms 38368 KB Output is correct
56 Correct 1151 ms 44080 KB Output is correct
57 Correct 439 ms 31308 KB Output is correct
58 Correct 422 ms 31096 KB Output is correct
59 Correct 572 ms 31180 KB Output is correct
60 Correct 481 ms 31352 KB Output is correct
61 Correct 1172 ms 43652 KB Output is correct
62 Correct 3 ms 384 KB Output is correct
63 Correct 1141 ms 42744 KB Output is correct
64 Correct 579 ms 30456 KB Output is correct
65 Correct 874 ms 37552 KB Output is correct
66 Correct 969 ms 42364 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 33556 KB Output is correct
2 Correct 441 ms 32608 KB Output is correct
3 Correct 177 ms 11000 KB Output is correct
4 Correct 435 ms 23968 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 507 ms 28764 KB Output is correct
7 Correct 92 ms 6392 KB Output is correct
8 Correct 84 ms 6264 KB Output is correct
9 Correct 179 ms 11128 KB Output is correct
10 Correct 390 ms 31776 KB Output is correct
11 Correct 125 ms 11000 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 3 ms 384 KB Output is correct
16 Correct 2 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 2 ms 384 KB Output is correct
22 Correct 2 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 2 ms 384 KB Output is correct
28 Correct 5 ms 768 KB Output is correct
29 Correct 5 ms 768 KB Output is correct
30 Correct 12 ms 896 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 6 ms 768 KB Output is correct
33 Correct 7 ms 896 KB Output is correct
34 Correct 6 ms 896 KB Output is correct
35 Correct 422 ms 23568 KB Output is correct
36 Correct 390 ms 31912 KB Output is correct
37 Correct 413 ms 31864 KB Output is correct
38 Correct 463 ms 31864 KB Output is correct
39 Correct 405 ms 25652 KB Output is correct
40 Correct 151 ms 11128 KB Output is correct
41 Correct 1268 ms 43384 KB Output is correct
42 Correct 206 ms 20824 KB Output is correct
43 Correct 127 ms 12536 KB Output is correct
44 Correct 559 ms 31352 KB Output is correct
45 Correct 900 ms 38640 KB Output is correct
46 Correct 1093 ms 43944 KB Output is correct
47 Correct 999 ms 43148 KB Output is correct
48 Correct 439 ms 31724 KB Output is correct
49 Correct 411 ms 31836 KB Output is correct
50 Correct 482 ms 31940 KB Output is correct
51 Correct 446 ms 31988 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 1300 ms 43468 KB Output is correct
54 Correct 706 ms 31260 KB Output is correct
55 Correct 923 ms 38368 KB Output is correct
56 Correct 1151 ms 44080 KB Output is correct
57 Correct 2488 ms 143424 KB Output is correct
58 Correct 2611 ms 143628 KB Output is correct
59 Correct 2554 ms 143456 KB Output is correct
60 Correct 2592 ms 143320 KB Output is correct
61 Correct 7905 ms 203380 KB Output is correct
62 Correct 4038 ms 137384 KB Output is correct
63 Correct 5451 ms 164176 KB Output is correct
64 Correct 7538 ms 198648 KB Output is correct
65 Correct 439 ms 31308 KB Output is correct
66 Correct 422 ms 31096 KB Output is correct
67 Correct 572 ms 31180 KB Output is correct
68 Correct 481 ms 31352 KB Output is correct
69 Correct 1172 ms 43652 KB Output is correct
70 Correct 3 ms 384 KB Output is correct
71 Correct 1141 ms 42744 KB Output is correct
72 Correct 579 ms 30456 KB Output is correct
73 Correct 874 ms 37552 KB Output is correct
74 Correct 969 ms 42364 KB Output is correct
75 Correct 2441 ms 143624 KB Output is correct
76 Correct 2414 ms 143492 KB Output is correct
77 Correct 2551 ms 143296 KB Output is correct
78 Correct 2458 ms 143320 KB Output is correct
79 Correct 7919 ms 203732 KB Output is correct
80 Correct 4273 ms 137376 KB Output is correct
81 Correct 5575 ms 165836 KB Output is correct
82 Correct 7591 ms 202432 KB Output is correct
83 Correct 7348 ms 194612 KB Output is correct