oj.uz

답안 #106880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106880 2019-04-20T19:52:19 Z eriksuenderhauf Two Dishes (JOI19_dishes) C++11
100 / 100
 8246 ms 203640 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) {
	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: 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 446 ms 32632 KB Output is correct
2 Correct 523 ms 31812 KB Output is correct
3 Correct 169 ms 10232 KB Output is correct
4 Correct 334 ms 23156 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 409 ms 28024 KB Output is correct
7 Correct 99 ms 5640 KB Output is correct
8 Correct 106 ms 5648 KB Output is correct
9 Correct 197 ms 10232 KB Output is correct
10 Correct 454 ms 31060 KB Output is correct
11 Correct 169 ms 10352 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 412 KB Output is correct
6 Correct 4 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 3 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 3 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 412 KB Output is correct
6 Correct 4 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 3 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 4 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 7 ms 784 KB Output is correct
22 Correct 7 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 3 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 412 KB Output is correct
6 Correct 4 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 3 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 4 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 7 ms 784 KB Output is correct
22 Correct 7 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 451 ms 23160 KB Output is correct
25 Correct 403 ms 31224 KB Output is correct
26 Correct 389 ms 31096 KB Output is correct
27 Correct 382 ms 31224 KB Output is correct
28 Correct 372 ms 24824 KB Output is correct
29 Correct 147 ms 10360 KB Output is correct
30 Correct 1098 ms 42796 KB Output is correct
31 Correct 215 ms 20088 KB Output is correct
32 Correct 133 ms 11896 KB Output is correct
33 Correct 644 ms 30692 KB Output is correct
34 Correct 889 ms 38008 KB Output is correct
35 Correct 1117 ms 43260 KB Output is correct
36 Correct 1198 ms 42184 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 412 KB Output is correct
6 Correct 4 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 3 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 4 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 7 ms 784 KB Output is correct
22 Correct 7 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 451 ms 23160 KB Output is correct
25 Correct 403 ms 31224 KB Output is correct
26 Correct 389 ms 31096 KB Output is correct
27 Correct 382 ms 31224 KB Output is correct
28 Correct 372 ms 24824 KB Output is correct
29 Correct 147 ms 10360 KB Output is correct
30 Correct 1098 ms 42796 KB Output is correct
31 Correct 215 ms 20088 KB Output is correct
32 Correct 133 ms 11896 KB Output is correct
33 Correct 644 ms 30692 KB Output is correct
34 Correct 889 ms 38008 KB Output is correct
35 Correct 1117 ms 43260 KB Output is correct
36 Correct 1198 ms 42184 KB Output is correct
37 Correct 512 ms 31020 KB Output is correct
38 Correct 436 ms 31096 KB Output is correct
39 Correct 515 ms 31048 KB Output is correct
40 Correct 471 ms 31224 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1175 ms 42716 KB Output is correct
43 Correct 666 ms 30588 KB Output is correct
44 Correct 965 ms 37468 KB Output is correct
45 Correct 1107 ms 43128 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 412 KB Output is correct
6 Correct 4 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 3 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 4 ms 768 KB Output is correct
18 Correct 5 ms 768 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 7 ms 784 KB Output is correct
22 Correct 7 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 451 ms 23160 KB Output is correct
25 Correct 403 ms 31224 KB Output is correct
26 Correct 389 ms 31096 KB Output is correct
27 Correct 382 ms 31224 KB Output is correct
28 Correct 372 ms 24824 KB Output is correct
29 Correct 147 ms 10360 KB Output is correct
30 Correct 1098 ms 42796 KB Output is correct
31 Correct 215 ms 20088 KB Output is correct
32 Correct 133 ms 11896 KB Output is correct
33 Correct 644 ms 30692 KB Output is correct
34 Correct 889 ms 38008 KB Output is correct
35 Correct 1117 ms 43260 KB Output is correct
36 Correct 1198 ms 42184 KB Output is correct
37 Correct 512 ms 31020 KB Output is correct
38 Correct 436 ms 31096 KB Output is correct
39 Correct 515 ms 31048 KB Output is correct
40 Correct 471 ms 31224 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 1175 ms 42716 KB Output is correct
43 Correct 666 ms 30588 KB Output is correct
44 Correct 965 ms 37468 KB Output is correct
45 Correct 1107 ms 43128 KB Output is correct
46 Correct 2716 ms 143136 KB Output is correct
47 Correct 2403 ms 143224 KB Output is correct
48 Correct 2552 ms 143096 KB Output is correct
49 Correct 2690 ms 143096 KB Output is correct
50 Correct 8246 ms 203256 KB Output is correct
51 Correct 4046 ms 137172 KB Output is correct
52 Correct 5524 ms 164020 KB Output is correct
53 Correct 7428 ms 198524 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 446 ms 32632 KB Output is correct
2 Correct 523 ms 31812 KB Output is correct
3 Correct 169 ms 10232 KB Output is correct
4 Correct 334 ms 23156 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 409 ms 28024 KB Output is correct
7 Correct 99 ms 5640 KB Output is correct
8 Correct 106 ms 5648 KB Output is correct
9 Correct 197 ms 10232 KB Output is correct
10 Correct 454 ms 31060 KB Output is correct
11 Correct 169 ms 10352 KB Output is correct
12 Correct 3 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 412 KB Output is correct
17 Correct 4 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 3 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 4 ms 768 KB Output is correct
29 Correct 5 ms 768 KB Output is correct
30 Correct 6 ms 896 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 7 ms 784 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 8 ms 768 KB Output is correct
35 Correct 451 ms 23160 KB Output is correct
36 Correct 403 ms 31224 KB Output is correct
37 Correct 389 ms 31096 KB Output is correct
38 Correct 382 ms 31224 KB Output is correct
39 Correct 372 ms 24824 KB Output is correct
40 Correct 147 ms 10360 KB Output is correct
41 Correct 1098 ms 42796 KB Output is correct
42 Correct 215 ms 20088 KB Output is correct
43 Correct 133 ms 11896 KB Output is correct
44 Correct 644 ms 30692 KB Output is correct
45 Correct 889 ms 38008 KB Output is correct
46 Correct 1117 ms 43260 KB Output is correct
47 Correct 1198 ms 42184 KB Output is correct
48 Correct 512 ms 31020 KB Output is correct
49 Correct 436 ms 31096 KB Output is correct
50 Correct 515 ms 31048 KB Output is correct
51 Correct 471 ms 31224 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 1175 ms 42716 KB Output is correct
54 Correct 666 ms 30588 KB Output is correct
55 Correct 965 ms 37468 KB Output is correct
56 Correct 1107 ms 43128 KB Output is correct
57 Correct 462 ms 31044 KB Output is correct
58 Correct 486 ms 31096 KB Output is correct
59 Correct 441 ms 31100 KB Output is correct
60 Correct 456 ms 31096 KB Output is correct
61 Correct 1079 ms 43672 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 1083 ms 42616 KB Output is correct
64 Correct 601 ms 30328 KB Output is correct
65 Correct 835 ms 37720 KB Output is correct
66 Correct 1040 ms 42304 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 446 ms 32632 KB Output is correct
2 Correct 523 ms 31812 KB Output is correct
3 Correct 169 ms 10232 KB Output is correct
4 Correct 334 ms 23156 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 409 ms 28024 KB Output is correct
7 Correct 99 ms 5640 KB Output is correct
8 Correct 106 ms 5648 KB Output is correct
9 Correct 197 ms 10232 KB Output is correct
10 Correct 454 ms 31060 KB Output is correct
11 Correct 169 ms 10352 KB Output is correct
12 Correct 3 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 412 KB Output is correct
17 Correct 4 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 3 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 4 ms 768 KB Output is correct
29 Correct 5 ms 768 KB Output is correct
30 Correct 6 ms 896 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 7 ms 784 KB Output is correct
33 Correct 7 ms 768 KB Output is correct
34 Correct 8 ms 768 KB Output is correct
35 Correct 451 ms 23160 KB Output is correct
36 Correct 403 ms 31224 KB Output is correct
37 Correct 389 ms 31096 KB Output is correct
38 Correct 382 ms 31224 KB Output is correct
39 Correct 372 ms 24824 KB Output is correct
40 Correct 147 ms 10360 KB Output is correct
41 Correct 1098 ms 42796 KB Output is correct
42 Correct 215 ms 20088 KB Output is correct
43 Correct 133 ms 11896 KB Output is correct
44 Correct 644 ms 30692 KB Output is correct
45 Correct 889 ms 38008 KB Output is correct
46 Correct 1117 ms 43260 KB Output is correct
47 Correct 1198 ms 42184 KB Output is correct
48 Correct 512 ms 31020 KB Output is correct
49 Correct 436 ms 31096 KB Output is correct
50 Correct 515 ms 31048 KB Output is correct
51 Correct 471 ms 31224 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 1175 ms 42716 KB Output is correct
54 Correct 666 ms 30588 KB Output is correct
55 Correct 965 ms 37468 KB Output is correct
56 Correct 1107 ms 43128 KB Output is correct
57 Correct 2716 ms 143136 KB Output is correct
58 Correct 2403 ms 143224 KB Output is correct
59 Correct 2552 ms 143096 KB Output is correct
60 Correct 2690 ms 143096 KB Output is correct
61 Correct 8246 ms 203256 KB Output is correct
62 Correct 4046 ms 137172 KB Output is correct
63 Correct 5524 ms 164020 KB Output is correct
64 Correct 7428 ms 198524 KB Output is correct
65 Correct 462 ms 31044 KB Output is correct
66 Correct 486 ms 31096 KB Output is correct
67 Correct 441 ms 31100 KB Output is correct
68 Correct 456 ms 31096 KB Output is correct
69 Correct 1079 ms 43672 KB Output is correct
70 Correct 2 ms 384 KB Output is correct
71 Correct 1083 ms 42616 KB Output is correct
72 Correct 601 ms 30328 KB Output is correct
73 Correct 835 ms 37720 KB Output is correct
74 Correct 1040 ms 42304 KB Output is correct
75 Correct 2321 ms 143248 KB Output is correct
76 Correct 2256 ms 143480 KB Output is correct
77 Correct 2585 ms 143240 KB Output is correct
78 Correct 2486 ms 143200 KB Output is correct
79 Correct 6749 ms 203640 KB Output is correct
80 Correct 3701 ms 137384 KB Output is correct
81 Correct 4649 ms 165792 KB Output is correct
82 Correct 6917 ms 202452 KB Output is correct
83 Correct 6913 ms 194784 KB Output is correct