oj.uz

Submission #123449

# Submission time Handle Problem Language Result Execution time Memory
123449 2019-07-01T12:58:07 Z youngyojun Two Dishes (JOI19_dishes) C++11
65 / 100
 3074 ms 42916 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define rb(x) ((x)&(-(x)))
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
 
const bool debug = 0;
 
const int MAXN = 200055;
const int MAXM = 200055;
 
struct BIT {
	ll d[MAXN];
 
	void upd(int x, ll r) {
		for(x += 5; x < MAXN; x += rb(x))
			d[x] += r;
	}
	ll get(int x) {
		ll r = 0; for(x += 5; x; x -= rb(x))
			r += d[x];
		return r;
	}
	ll get(int s, int e) { return s > e ? 0 : get(e) - get(s-1); }
} bit;
 
struct SEG {
	ll ds[MAXN*3];
	bitset<MAXN*3> dz;
 
	void prop(int i, int s, int e) {
		if(dz[i]) {
			ds[i] = 0;
			if(s != e) dz[i<<1] = dz[i<<1|1] = true;
			dz[i] = false;
			return;
		}
		if(s == e) return;
		ds[i] = 0;
		if(!dz[i<<1]) ds[i] += ds[i<<1];
		if(!dz[i<<1|1]) ds[i] += ds[i<<1|1];
	}
	void updz(int i, int s, int e, int p, int q) {
		prop(i, s, e); if(q < p || e < p || q < s) return;
		if(p <= s && e <= q) {
			dz[i] = true;
			prop(i, s, e);
			return;
		}
		int m = (s+e) >> 1;
		updz(i<<1, s, m, p, q);
		updz(i<<1|1, m+1, e, p, q);
		ds[i] = ds[i<<1] + ds[i<<1|1];
	}
	void updp(int i, int s, int e, int x, ll r) {
		prop(i, s, e); if(x < s || e < x) return;
		if(s == e) {
			ds[i] = r;
			return;
		}
		int m = (s+e) >> 1;
		updp(i<<1, s, m, x, r);
		updp(i<<1|1, m+1, e, x, r);
		ds[i] = ds[i<<1] + ds[i<<1|1];
	}
	void upddx(int i, int s, int e, int x, ll r) {
		prop(i, s, e); if(x < s || e < x) return;
		if(s == e) {
			ds[i] += r;
			return;
		}
		int m = (s+e) >> 1;
		upddx(i<<1, s, m, x, r);
		upddx(i<<1|1, m+1, e, x, r);
		ds[i] = ds[i<<1] + ds[i<<1|1];
	}
	ll get(int i, int s, int e, int p, int q) {
		prop(i, s, e); if(q < p || e < p || q < s) return 0;
		if(p <= s && e <= q) return ds[i];
		int m = (s+e) >> 1;
		ll ret = get(i<<1, s, m, p, q) + get(i<<1|1, m+1, e, p, q);
		ds[i] = ds[i<<1] + ds[i<<1|1];
		return ret;
	}
	ll get(int i, int s, int e, int x) { return get(1, s, e, x, x); }
} seg;

vector<pii> PopEV[MAXM];
vector<pii> PushEV[MAXM];

ll SA[MAXN], SB[MAXM];
int FI[MAXN], GI[MAXM];

ll C[MAXN], D[MAXM];
int A[MAXN], B[MAXM];
int E[MAXN], F[MAXM];

ll Delta;
int N, M;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> M;
	for(int i = 1; i <= N; i++)
		cin >> A[i] >> C[i] >> E[i];
	for(int i = 1; i <= M; i++)
		cin >> B[i] >> D[i] >> F[i];
	
	for(int i = 1; i <= N; i++) SA[i] = SA[i-1] + A[i];
	for(int i = 1; i <= M; i++) SB[i] = SB[i-1] + B[i];

	for(int i = 1; i <= N; i++)
		FI[i] = int(upper_bound(SB, SB+M+1, C[i]-SA[i])-SB) - 1;
	for(int i = 1; i <= M; i++)
		GI[i] = int(upper_bound(SA, SA+N+1, D[i]-SB[i])-SA) - 1;

	for(int i = 1; i <= N; i++) if(0 <= FI[i] && E[i]) {
		if(0 < E[i]) {
			PopEV[FI[i]+1].eb(i, E[i]);
			bit.upd(i, E[i]);
		} else {
			Delta += E[i];
			if(FI[i] < M) PushEV[FI[i]+1].eb(i, -E[i]);
		}
	}
	for(int i = 1; i <= M; i++) if(0 <= GI[i] && F[i]) {
		if(0 < F[i]) PushEV[i].eb(GI[i], F[i]);
		else {
			Delta += F[i];
			if(GI[i] < N) {
				PopEV[i].eb(GI[i]+1, -F[i]);
				bit.upd(GI[i]+1, -F[i]);
			}
		}
	}
	
	if(debug) {
		printf("N=%d, M=%d\n", N, M);
		for(int i = 1; i <= N; i++) printf("%d ", FI[i]);
		puts("");
		for(int i = 1; i <= M; i++) printf("%d ", GI[i]);
		puts("");
	}
	
	for(int j = 1; j <= M; j++) {
		for(auto &ev : PopEV[j]) {
			int i, ei; tie(i, ei) = ev;
			bit.upd(i, -ei);
			seg.upddx(1, 1, N, i, ei);
			if(debug) {
				printf("j=%d, pop %d %d\n", j, i, ei);
			}
		}

		for(auto &ev : PushEV[j]) {
			int i, ei; tie(i, ei) = ev;
			Delta += ei;
			int s = i+1, e = N+1; for(int m; s < e;) {
				m = (s+e) >> 1;
				if(seg.get(1, 1, N, i+1, m) < ei) s = m+1;
				else e = m;
			}
			ll t = seg.get(1, 1, N, i+1, s-1);
			seg.updz(1, 1, N, i+1, s-1);
			if(s <= N) seg.upddx(1, 1, N, s, t-ei);
		}

		if(debug) {
			printf("j=%d / %lld\n", j, Delta);
			for(int i = 1; i <= N; i++) printf("%lld ", bit.get(i, i));
			puts("");
			for(int i = 1; i <= N; i++) printf("%lld ", seg.get(1, 1, N, i));
			puts("");
		}
	}

	cout << bit.get(1, N) + seg.get(1, 1, N, 1, N) + Delta << endl;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2323 ms 37008 KB Output is correct
2 Correct 1854 ms 36984 KB Output is correct
3 Correct 272 ms 31200 KB Output is correct
4 Correct 1709 ms 34168 KB Output is correct
5 Correct 13 ms 9848 KB Output is correct
6 Correct 1641 ms 35572 KB Output is correct
7 Correct 131 ms 21960 KB Output is correct
8 Correct 127 ms 19484 KB Output is correct
9 Correct 267 ms 31052 KB Output is correct
10 Correct 2228 ms 40128 KB Output is correct
11 Correct 204 ms 31180 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9848 KB Output is correct
2 Correct 10 ms 9848 KB Output is correct
3 Correct 10 ms 9976 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 10 ms 9976 KB Output is correct
6 Correct 10 ms 9976 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9848 KB Output is correct
9 Correct 10 ms 9900 KB Output is correct
10 Correct 10 ms 9976 KB Output is correct
11 Correct 10 ms 9976 KB Output is correct
12 Correct 10 ms 9848 KB Output is correct
13 Correct 11 ms 9976 KB Output is correct
14 Correct 10 ms 9976 KB Output is correct
15 Correct 10 ms 9976 KB Output is correct
16 Correct 10 ms 9848 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9848 KB Output is correct
2 Correct 10 ms 9848 KB Output is correct
3 Correct 10 ms 9976 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 10 ms 9976 KB Output is correct
6 Correct 10 ms 9976 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9848 KB Output is correct
9 Correct 10 ms 9900 KB Output is correct
10 Correct 10 ms 9976 KB Output is correct
11 Correct 10 ms 9976 KB Output is correct
12 Correct 10 ms 9848 KB Output is correct
13 Correct 11 ms 9976 KB Output is correct
14 Correct 10 ms 9976 KB Output is correct
15 Correct 10 ms 9976 KB Output is correct
16 Correct 10 ms 9848 KB Output is correct
17 Correct 13 ms 10232 KB Output is correct
18 Correct 17 ms 10232 KB Output is correct
19 Correct 24 ms 10232 KB Output is correct
20 Correct 18 ms 10232 KB Output is correct
21 Correct 23 ms 10232 KB Output is correct
22 Correct 23 ms 10232 KB Output is correct
23 Correct 23 ms 10232 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9848 KB Output is correct
2 Correct 10 ms 9848 KB Output is correct
3 Correct 10 ms 9976 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 10 ms 9976 KB Output is correct
6 Correct 10 ms 9976 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9848 KB Output is correct
9 Correct 10 ms 9900 KB Output is correct
10 Correct 10 ms 9976 KB Output is correct
11 Correct 10 ms 9976 KB Output is correct
12 Correct 10 ms 9848 KB Output is correct
13 Correct 11 ms 9976 KB Output is correct
14 Correct 10 ms 9976 KB Output is correct
15 Correct 10 ms 9976 KB Output is correct
16 Correct 10 ms 9848 KB Output is correct
17 Correct 13 ms 10232 KB Output is correct
18 Correct 17 ms 10232 KB Output is correct
19 Correct 24 ms 10232 KB Output is correct
20 Correct 18 ms 10232 KB Output is correct
21 Correct 23 ms 10232 KB Output is correct
22 Correct 23 ms 10232 KB Output is correct
23 Correct 23 ms 10232 KB Output is correct
24 Correct 291 ms 32016 KB Output is correct
25 Correct 1464 ms 30588 KB Output is correct
26 Correct 318 ms 36728 KB Output is correct
27 Correct 2319 ms 34640 KB Output is correct
28 Correct 964 ms 35220 KB Output is correct
29 Correct 236 ms 31208 KB Output is correct
30 Correct 2897 ms 37752 KB Output is correct
31 Correct 120 ms 22608 KB Output is correct
32 Correct 152 ms 23752 KB Output is correct
33 Correct 1590 ms 32888 KB Output is correct
34 Correct 2174 ms 36340 KB Output is correct
35 Correct 2921 ms 37880 KB Output is correct
36 Correct 2845 ms 37628 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9848 KB Output is correct
2 Correct 10 ms 9848 KB Output is correct
3 Correct 10 ms 9976 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 10 ms 9976 KB Output is correct
6 Correct 10 ms 9976 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9848 KB Output is correct
9 Correct 10 ms 9900 KB Output is correct
10 Correct 10 ms 9976 KB Output is correct
11 Correct 10 ms 9976 KB Output is correct
12 Correct 10 ms 9848 KB Output is correct
13 Correct 11 ms 9976 KB Output is correct
14 Correct 10 ms 9976 KB Output is correct
15 Correct 10 ms 9976 KB Output is correct
16 Correct 10 ms 9848 KB Output is correct
17 Correct 13 ms 10232 KB Output is correct
18 Correct 17 ms 10232 KB Output is correct
19 Correct 24 ms 10232 KB Output is correct
20 Correct 18 ms 10232 KB Output is correct
21 Correct 23 ms 10232 KB Output is correct
22 Correct 23 ms 10232 KB Output is correct
23 Correct 23 ms 10232 KB Output is correct
24 Correct 291 ms 32016 KB Output is correct
25 Correct 1464 ms 30588 KB Output is correct
26 Correct 318 ms 36728 KB Output is correct
27 Correct 2319 ms 34640 KB Output is correct
28 Correct 964 ms 35220 KB Output is correct
29 Correct 236 ms 31208 KB Output is correct
30 Correct 2897 ms 37752 KB Output is correct
31 Correct 120 ms 22608 KB Output is correct
32 Correct 152 ms 23752 KB Output is correct
33 Correct 1590 ms 32888 KB Output is correct
34 Correct 2174 ms 36340 KB Output is correct
35 Correct 2921 ms 37880 KB Output is correct
36 Correct 2845 ms 37628 KB Output is correct
37 Correct 347 ms 36744 KB Output is correct
38 Correct 2369 ms 34416 KB Output is correct
39 Correct 2727 ms 40008 KB Output is correct
40 Correct 2092 ms 39928 KB Output is correct
41 Correct 10 ms 9848 KB Output is correct
42 Correct 3010 ms 37776 KB Output is correct
43 Correct 1613 ms 32828 KB Output is correct
44 Correct 2187 ms 36180 KB Output is correct
45 Correct 3074 ms 37968 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9848 KB Output is correct
2 Correct 10 ms 9848 KB Output is correct
3 Correct 10 ms 9976 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 10 ms 9976 KB Output is correct
6 Correct 10 ms 9976 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9848 KB Output is correct
9 Correct 10 ms 9900 KB Output is correct
10 Correct 10 ms 9976 KB Output is correct
11 Correct 10 ms 9976 KB Output is correct
12 Correct 10 ms 9848 KB Output is correct
13 Correct 11 ms 9976 KB Output is correct
14 Correct 10 ms 9976 KB Output is correct
15 Correct 10 ms 9976 KB Output is correct
16 Correct 10 ms 9848 KB Output is correct
17 Correct 13 ms 10232 KB Output is correct
18 Correct 17 ms 10232 KB Output is correct
19 Correct 24 ms 10232 KB Output is correct
20 Correct 18 ms 10232 KB Output is correct
21 Correct 23 ms 10232 KB Output is correct
22 Correct 23 ms 10232 KB Output is correct
23 Correct 23 ms 10232 KB Output is correct
24 Correct 291 ms 32016 KB Output is correct
25 Correct 1464 ms 30588 KB Output is correct
26 Correct 318 ms 36728 KB Output is correct
27 Correct 2319 ms 34640 KB Output is correct
28 Correct 964 ms 35220 KB Output is correct
29 Correct 236 ms 31208 KB Output is correct
30 Correct 2897 ms 37752 KB Output is correct
31 Correct 120 ms 22608 KB Output is correct
32 Correct 152 ms 23752 KB Output is correct
33 Correct 1590 ms 32888 KB Output is correct
34 Correct 2174 ms 36340 KB Output is correct
35 Correct 2921 ms 37880 KB Output is correct
36 Correct 2845 ms 37628 KB Output is correct
37 Correct 347 ms 36744 KB Output is correct
38 Correct 2369 ms 34416 KB Output is correct
39 Correct 2727 ms 40008 KB Output is correct
40 Correct 2092 ms 39928 KB Output is correct
41 Correct 10 ms 9848 KB Output is correct
42 Correct 3010 ms 37776 KB Output is correct
43 Correct 1613 ms 32828 KB Output is correct
44 Correct 2187 ms 36180 KB Output is correct
45 Correct 3074 ms 37968 KB Output is correct
46 Runtime error 1140 ms 42916 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2323 ms 37008 KB Output is correct
2 Correct 1854 ms 36984 KB Output is correct
3 Correct 272 ms 31200 KB Output is correct
4 Correct 1709 ms 34168 KB Output is correct
5 Correct 13 ms 9848 KB Output is correct
6 Correct 1641 ms 35572 KB Output is correct
7 Correct 131 ms 21960 KB Output is correct
8 Correct 127 ms 19484 KB Output is correct
9 Correct 267 ms 31052 KB Output is correct
10 Correct 2228 ms 40128 KB Output is correct
11 Correct 204 ms 31180 KB Output is correct
12 Correct 10 ms 9848 KB Output is correct
13 Correct 10 ms 9848 KB Output is correct
14 Correct 10 ms 9976 KB Output is correct
15 Correct 10 ms 9848 KB Output is correct
16 Correct 10 ms 9976 KB Output is correct
17 Correct 10 ms 9976 KB Output is correct
18 Correct 10 ms 9848 KB Output is correct
19 Correct 10 ms 9848 KB Output is correct
20 Correct 10 ms 9900 KB Output is correct
21 Correct 10 ms 9976 KB Output is correct
22 Correct 10 ms 9976 KB Output is correct
23 Correct 10 ms 9848 KB Output is correct
24 Correct 11 ms 9976 KB Output is correct
25 Correct 10 ms 9976 KB Output is correct
26 Correct 10 ms 9976 KB Output is correct
27 Correct 10 ms 9848 KB Output is correct
28 Correct 13 ms 10232 KB Output is correct
29 Correct 17 ms 10232 KB Output is correct
30 Correct 24 ms 10232 KB Output is correct
31 Correct 18 ms 10232 KB Output is correct
32 Correct 23 ms 10232 KB Output is correct
33 Correct 23 ms 10232 KB Output is correct
34 Correct 23 ms 10232 KB Output is correct
35 Correct 291 ms 32016 KB Output is correct
36 Correct 1464 ms 30588 KB Output is correct
37 Correct 318 ms 36728 KB Output is correct
38 Correct 2319 ms 34640 KB Output is correct
39 Correct 964 ms 35220 KB Output is correct
40 Correct 236 ms 31208 KB Output is correct
41 Correct 2897 ms 37752 KB Output is correct
42 Correct 120 ms 22608 KB Output is correct
43 Correct 152 ms 23752 KB Output is correct
44 Correct 1590 ms 32888 KB Output is correct
45 Correct 2174 ms 36340 KB Output is correct
46 Correct 2921 ms 37880 KB Output is correct
47 Correct 2845 ms 37628 KB Output is correct
48 Correct 347 ms 36744 KB Output is correct
49 Correct 2369 ms 34416 KB Output is correct
50 Correct 2727 ms 40008 KB Output is correct
51 Correct 2092 ms 39928 KB Output is correct
52 Correct 10 ms 9848 KB Output is correct
53 Correct 3010 ms 37776 KB Output is correct
54 Correct 1613 ms 32828 KB Output is correct
55 Correct 2187 ms 36180 KB Output is correct
56 Correct 3074 ms 37968 KB Output is correct
57 Correct 2356 ms 31468 KB Output is correct
58 Correct 341 ms 33204 KB Output is correct
59 Incorrect 403 ms 33016 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2323 ms 37008 KB Output is correct
2 Correct 1854 ms 36984 KB Output is correct
3 Correct 272 ms 31200 KB Output is correct
4 Correct 1709 ms 34168 KB Output is correct
5 Correct 13 ms 9848 KB Output is correct
6 Correct 1641 ms 35572 KB Output is correct
7 Correct 131 ms 21960 KB Output is correct
8 Correct 127 ms 19484 KB Output is correct
9 Correct 267 ms 31052 KB Output is correct
10 Correct 2228 ms 40128 KB Output is correct
11 Correct 204 ms 31180 KB Output is correct
12 Correct 10 ms 9848 KB Output is correct
13 Correct 10 ms 9848 KB Output is correct
14 Correct 10 ms 9976 KB Output is correct
15 Correct 10 ms 9848 KB Output is correct
16 Correct 10 ms 9976 KB Output is correct
17 Correct 10 ms 9976 KB Output is correct
18 Correct 10 ms 9848 KB Output is correct
19 Correct 10 ms 9848 KB Output is correct
20 Correct 10 ms 9900 KB Output is correct
21 Correct 10 ms 9976 KB Output is correct
22 Correct 10 ms 9976 KB Output is correct
23 Correct 10 ms 9848 KB Output is correct
24 Correct 11 ms 9976 KB Output is correct
25 Correct 10 ms 9976 KB Output is correct
26 Correct 10 ms 9976 KB Output is correct
27 Correct 10 ms 9848 KB Output is correct
28 Correct 13 ms 10232 KB Output is correct
29 Correct 17 ms 10232 KB Output is correct
30 Correct 24 ms 10232 KB Output is correct
31 Correct 18 ms 10232 KB Output is correct
32 Correct 23 ms 10232 KB Output is correct
33 Correct 23 ms 10232 KB Output is correct
34 Correct 23 ms 10232 KB Output is correct
35 Correct 291 ms 32016 KB Output is correct
36 Correct 1464 ms 30588 KB Output is correct
37 Correct 318 ms 36728 KB Output is correct
38 Correct 2319 ms 34640 KB Output is correct
39 Correct 964 ms 35220 KB Output is correct
40 Correct 236 ms 31208 KB Output is correct
41 Correct 2897 ms 37752 KB Output is correct
42 Correct 120 ms 22608 KB Output is correct
43 Correct 152 ms 23752 KB Output is correct
44 Correct 1590 ms 32888 KB Output is correct
45 Correct 2174 ms 36340 KB Output is correct
46 Correct 2921 ms 37880 KB Output is correct
47 Correct 2845 ms 37628 KB Output is correct
48 Correct 347 ms 36744 KB Output is correct
49 Correct 2369 ms 34416 KB Output is correct
50 Correct 2727 ms 40008 KB Output is correct
51 Correct 2092 ms 39928 KB Output is correct
52 Correct 10 ms 9848 KB Output is correct
53 Correct 3010 ms 37776 KB Output is correct
54 Correct 1613 ms 32828 KB Output is correct
55 Correct 2187 ms 36180 KB Output is correct
56 Correct 3074 ms 37968 KB Output is correct
57 Runtime error 1140 ms 42916 KB Execution killed with signal 11 (could be triggered by violating memory limits)
58 Halted 0 ms 0 KB -