oj.uz

Submission #123401

# Submission time Handle Problem Language Result Execution time Memory
123401 2019-07-01T11:37:14 Z sebinkim Two Dishes (JOI19_dishes) C++14
74 / 100
 4356 ms 244712 KB 
#include <bits/stdc++.h>

using namespace std;

typedef __int128_t ll;

struct fenwick{
	ll T[1010101];
	ll m;
	
	void init(ll _m) { m = _m; }
	
	void addval(ll p, ll v)
	{
		if(!p) T[0] += v;
		else{
			for(; p<=m; p+=p&-p){
				T[p] += v;
			}
		}
	}
	
	ll getval(ll p)
	{
		ll ret = T[0];
		
		for(; p; p-=p&-p){
			ret += T[p];
		}
		
		return ret;
	}
};

ll A[1010101], S[1010101], P1[1010101], P2[1010101];
ll B[1010101], T[1010101], Q1[1010101], Q2[1010101];
vector <ll> V[1010101];
set <ll> X;
fenwick F;
ll n, m, ans;

void query(ll f, ll p, ll k)
{
	ll x;
	
	if(f == 0) F.addval(0, k);
	else if(f == 1){
		if(X.find(p) == X.end()) X.insert(p);
		F.addval(p, k);
		return;
	}
	else if(f == 2){
		if(X.find(p) == X.end()) X.insert(p);
		F.addval(p, k);
	}
	
	for(; ; ){
		auto it = X.upper_bound(p);
		if(it == X.end()) break;
		
		x = F.getval(*it) - F.getval(*it - 1) - Q1[*it];
		
		if(x <= k){
			F.addval(*it, -x); k -= x;
			X.erase(it);
		}
		else{
			F.addval(*it, -k);
			break;
		}
	}
}

int main()
{
	ll i, k, x;
	long long _i1, _i2, _i3;
	
	scanf("%lld%lld", &_i1, &_i2);
	n = _i1; m = _i2;
	
	for(i=1; i<=n; i++){
		scanf("%lld%lld%lld", &_i1, &_i2, &_i3);
		A[i] = _i1; S[i] = _i2; P1[i] = _i3;
		A[i] += A[i - 1];
		if(P1[i] < 0){
			ans += P1[i];
			P2[i] = -P1[i], P1[i] = 0;
		}
	}
	
	for(i=1; i<=m; i++){
		scanf("%lld%lld%lld", &_i1, &_i2, &_i3);
		B[i] = _i1; T[i] = _i2; Q1[i] = _i3;
		B[i] += B[i - 1];
		if(Q1[i] < 0){
			ans += Q1[i];
			Q2[i] = -Q1[i], Q1[i] = 0;
		}
	}	
	
	for(i=1; i<=n; i++){
		S[i] = upper_bound(B, B + m + 1, S[i] - A[i]) - B;
	}
	
	for(i=1; i<=m; i++){
		T[i] = upper_bound(A, A + n + 1, T[i] - B[i]) - A;
		V[T[i]].push_back(i);
	}
	
	F.init(m);
	
	for(i=1; i<=m; i++){
		if(T[i] == 0) swap(Q1[i], Q2[i]);
		F.addval(i, Q1[i]);
	}
	
	for(i=1; i<=n; i++){
		for(ll &t: V[i]){
			swap(Q1[t], Q2[t]);
			
			if(Q1[t] == 0){
				if(X.find(t) == X.end()) X.insert(t);
			}
			else{
				if(X.find(t) == X.end()){
					query(2, t, Q1[t]);
				}
				else{
					x = F.getval(t) - F.getval(t - 1);
					if(x <= Q1[t]){
						X.erase(t);
						query(2, t, Q1[t] - x);
					}
				}
			}
		}
		
		if(S[i] == 0) F.addval(0, P2[i]);
		else if(S[i] > m) F.addval(0, P1[i]);
		else{
			query(0, S[i] - 1, P1[i]);
			query(1, S[i], P2[i]);
		}
	}
	
	printf("%lld\n", (long long)(F.getval(m) + ans));
	
	return 0;
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:76:8: warning: unused variable 'k' [-Wunused-variable]
  ll i, k, x;
        ^
dishes.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &_i1, &_i2);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &_i1, &_i2, &_i3);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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", &_i1, &_i2, &_i3);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 68980 KB Output is correct
2 Correct 376 ms 56684 KB Output is correct
3 Correct 275 ms 51832 KB Output is correct
4 Correct 415 ms 63840 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 387 ms 54508 KB Output is correct
7 Correct 152 ms 42788 KB Output is correct
8 Correct 140 ms 35652 KB Output is correct
9 Correct 290 ms 52204 KB Output is correct
10 Correct 360 ms 57852 KB Output is correct
11 Correct 210 ms 51568 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24056 KB Output is correct
2 Correct 23 ms 24056 KB Output is correct
3 Correct 23 ms 24060 KB Output is correct
4 Correct 28 ms 24184 KB Output is correct
5 Correct 28 ms 24184 KB Output is correct
6 Correct 24 ms 24132 KB Output is correct
7 Correct 29 ms 24184 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24188 KB Output is correct
13 Correct 23 ms 24184 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 23 ms 24104 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24056 KB Output is correct
2 Correct 23 ms 24056 KB Output is correct
3 Correct 23 ms 24060 KB Output is correct
4 Correct 28 ms 24184 KB Output is correct
5 Correct 28 ms 24184 KB Output is correct
6 Correct 24 ms 24132 KB Output is correct
7 Correct 29 ms 24184 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24188 KB Output is correct
13 Correct 23 ms 24184 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 23 ms 24104 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 26 ms 24440 KB Output is correct
18 Correct 25 ms 24568 KB Output is correct
19 Correct 27 ms 24568 KB Output is correct
20 Correct 26 ms 24420 KB Output is correct
21 Correct 26 ms 24568 KB Output is correct
22 Correct 26 ms 24440 KB Output is correct
23 Correct 27 ms 24412 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24056 KB Output is correct
2 Correct 23 ms 24056 KB Output is correct
3 Correct 23 ms 24060 KB Output is correct
4 Correct 28 ms 24184 KB Output is correct
5 Correct 28 ms 24184 KB Output is correct
6 Correct 24 ms 24132 KB Output is correct
7 Correct 29 ms 24184 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24188 KB Output is correct
13 Correct 23 ms 24184 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 23 ms 24104 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 26 ms 24440 KB Output is correct
18 Correct 25 ms 24568 KB Output is correct
19 Correct 27 ms 24568 KB Output is correct
20 Correct 26 ms 24420 KB Output is correct
21 Correct 26 ms 24568 KB Output is correct
22 Correct 26 ms 24440 KB Output is correct
23 Correct 27 ms 24412 KB Output is correct
24 Correct 299 ms 54708 KB Output is correct
25 Correct 376 ms 67092 KB Output is correct
26 Correct 449 ms 67068 KB Output is correct
27 Correct 391 ms 70264 KB Output is correct
28 Correct 370 ms 55400 KB Output is correct
29 Correct 235 ms 52060 KB Output is correct
30 Correct 681 ms 57148 KB Output is correct
31 Correct 197 ms 51328 KB Output is correct
32 Correct 136 ms 35372 KB Output is correct
33 Correct 478 ms 56392 KB Output is correct
34 Correct 555 ms 61320 KB Output is correct
35 Correct 597 ms 56308 KB Output is correct
36 Correct 640 ms 56312 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24056 KB Output is correct
2 Correct 23 ms 24056 KB Output is correct
3 Correct 23 ms 24060 KB Output is correct
4 Correct 28 ms 24184 KB Output is correct
5 Correct 28 ms 24184 KB Output is correct
6 Correct 24 ms 24132 KB Output is correct
7 Correct 29 ms 24184 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24188 KB Output is correct
13 Correct 23 ms 24184 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 23 ms 24104 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 26 ms 24440 KB Output is correct
18 Correct 25 ms 24568 KB Output is correct
19 Correct 27 ms 24568 KB Output is correct
20 Correct 26 ms 24420 KB Output is correct
21 Correct 26 ms 24568 KB Output is correct
22 Correct 26 ms 24440 KB Output is correct
23 Correct 27 ms 24412 KB Output is correct
24 Correct 299 ms 54708 KB Output is correct
25 Correct 376 ms 67092 KB Output is correct
26 Correct 449 ms 67068 KB Output is correct
27 Correct 391 ms 70264 KB Output is correct
28 Correct 370 ms 55400 KB Output is correct
29 Correct 235 ms 52060 KB Output is correct
30 Correct 681 ms 57148 KB Output is correct
31 Correct 197 ms 51328 KB Output is correct
32 Correct 136 ms 35372 KB Output is correct
33 Correct 478 ms 56392 KB Output is correct
34 Correct 555 ms 61320 KB Output is correct
35 Correct 597 ms 56308 KB Output is correct
36 Correct 640 ms 56312 KB Output is correct
37 Correct 358 ms 55348 KB Output is correct
38 Correct 464 ms 70968 KB Output is correct
39 Correct 582 ms 70404 KB Output is correct
40 Correct 368 ms 57896 KB Output is correct
41 Correct 23 ms 24184 KB Output is correct
42 Correct 733 ms 57336 KB Output is correct
43 Correct 512 ms 56100 KB Output is correct
44 Correct 605 ms 61084 KB Output is correct
45 Correct 636 ms 56568 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24056 KB Output is correct
2 Correct 23 ms 24056 KB Output is correct
3 Correct 23 ms 24060 KB Output is correct
4 Correct 28 ms 24184 KB Output is correct
5 Correct 28 ms 24184 KB Output is correct
6 Correct 24 ms 24132 KB Output is correct
7 Correct 29 ms 24184 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24188 KB Output is correct
13 Correct 23 ms 24184 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 23 ms 24104 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 26 ms 24440 KB Output is correct
18 Correct 25 ms 24568 KB Output is correct
19 Correct 27 ms 24568 KB Output is correct
20 Correct 26 ms 24420 KB Output is correct
21 Correct 26 ms 24568 KB Output is correct
22 Correct 26 ms 24440 KB Output is correct
23 Correct 27 ms 24412 KB Output is correct
24 Correct 299 ms 54708 KB Output is correct
25 Correct 376 ms 67092 KB Output is correct
26 Correct 449 ms 67068 KB Output is correct
27 Correct 391 ms 70264 KB Output is correct
28 Correct 370 ms 55400 KB Output is correct
29 Correct 235 ms 52060 KB Output is correct
30 Correct 681 ms 57148 KB Output is correct
31 Correct 197 ms 51328 KB Output is correct
32 Correct 136 ms 35372 KB Output is correct
33 Correct 478 ms 56392 KB Output is correct
34 Correct 555 ms 61320 KB Output is correct
35 Correct 597 ms 56308 KB Output is correct
36 Correct 640 ms 56312 KB Output is correct
37 Correct 358 ms 55348 KB Output is correct
38 Correct 464 ms 70968 KB Output is correct
39 Correct 582 ms 70404 KB Output is correct
40 Correct 368 ms 57896 KB Output is correct
41 Correct 23 ms 24184 KB Output is correct
42 Correct 733 ms 57336 KB Output is correct
43 Correct 512 ms 56100 KB Output is correct
44 Correct 605 ms 61084 KB Output is correct
45 Correct 636 ms 56568 KB Output is correct
46 Correct 1707 ms 166936 KB Output is correct
47 Correct 2321 ms 244712 KB Output is correct
48 Correct 2855 ms 244612 KB Output is correct
49 Correct 1766 ms 181664 KB Output is correct
50 Correct 4356 ms 177620 KB Output is correct
51 Correct 2902 ms 169416 KB Output is correct
52 Correct 3394 ms 189160 KB Output is correct
53 Correct 3823 ms 179396 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 68980 KB Output is correct
2 Correct 376 ms 56684 KB Output is correct
3 Correct 275 ms 51832 KB Output is correct
4 Correct 415 ms 63840 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 387 ms 54508 KB Output is correct
7 Correct 152 ms 42788 KB Output is correct
8 Correct 140 ms 35652 KB Output is correct
9 Correct 290 ms 52204 KB Output is correct
10 Correct 360 ms 57852 KB Output is correct
11 Correct 210 ms 51568 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 23 ms 24056 KB Output is correct
14 Correct 23 ms 24060 KB Output is correct
15 Correct 28 ms 24184 KB Output is correct
16 Correct 28 ms 24184 KB Output is correct
17 Correct 24 ms 24132 KB Output is correct
18 Correct 29 ms 24184 KB Output is correct
19 Correct 23 ms 24184 KB Output is correct
20 Correct 23 ms 24184 KB Output is correct
21 Correct 22 ms 24184 KB Output is correct
22 Correct 23 ms 24184 KB Output is correct
23 Correct 23 ms 24188 KB Output is correct
24 Correct 23 ms 24184 KB Output is correct
25 Correct 23 ms 24184 KB Output is correct
26 Correct 23 ms 24104 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 26 ms 24440 KB Output is correct
29 Correct 25 ms 24568 KB Output is correct
30 Correct 27 ms 24568 KB Output is correct
31 Correct 26 ms 24420 KB Output is correct
32 Correct 26 ms 24568 KB Output is correct
33 Correct 26 ms 24440 KB Output is correct
34 Correct 27 ms 24412 KB Output is correct
35 Correct 299 ms 54708 KB Output is correct
36 Correct 376 ms 67092 KB Output is correct
37 Correct 449 ms 67068 KB Output is correct
38 Correct 391 ms 70264 KB Output is correct
39 Correct 370 ms 55400 KB Output is correct
40 Correct 235 ms 52060 KB Output is correct
41 Correct 681 ms 57148 KB Output is correct
42 Correct 197 ms 51328 KB Output is correct
43 Correct 136 ms 35372 KB Output is correct
44 Correct 478 ms 56392 KB Output is correct
45 Correct 555 ms 61320 KB Output is correct
46 Correct 597 ms 56308 KB Output is correct
47 Correct 640 ms 56312 KB Output is correct
48 Correct 358 ms 55348 KB Output is correct
49 Correct 464 ms 70968 KB Output is correct
50 Correct 582 ms 70404 KB Output is correct
51 Correct 368 ms 57896 KB Output is correct
52 Correct 23 ms 24184 KB Output is correct
53 Correct 733 ms 57336 KB Output is correct
54 Correct 512 ms 56100 KB Output is correct
55 Correct 605 ms 61084 KB Output is correct
56 Correct 636 ms 56568 KB Output is correct
57 Correct 480 ms 71148 KB Output is correct
58 Correct 525 ms 74360 KB Output is correct
59 Incorrect 394 ms 58636 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 68980 KB Output is correct
2 Correct 376 ms 56684 KB Output is correct
3 Correct 275 ms 51832 KB Output is correct
4 Correct 415 ms 63840 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 387 ms 54508 KB Output is correct
7 Correct 152 ms 42788 KB Output is correct
8 Correct 140 ms 35652 KB Output is correct
9 Correct 290 ms 52204 KB Output is correct
10 Correct 360 ms 57852 KB Output is correct
11 Correct 210 ms 51568 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 23 ms 24056 KB Output is correct
14 Correct 23 ms 24060 KB Output is correct
15 Correct 28 ms 24184 KB Output is correct
16 Correct 28 ms 24184 KB Output is correct
17 Correct 24 ms 24132 KB Output is correct
18 Correct 29 ms 24184 KB Output is correct
19 Correct 23 ms 24184 KB Output is correct
20 Correct 23 ms 24184 KB Output is correct
21 Correct 22 ms 24184 KB Output is correct
22 Correct 23 ms 24184 KB Output is correct
23 Correct 23 ms 24188 KB Output is correct
24 Correct 23 ms 24184 KB Output is correct
25 Correct 23 ms 24184 KB Output is correct
26 Correct 23 ms 24104 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 26 ms 24440 KB Output is correct
29 Correct 25 ms 24568 KB Output is correct
30 Correct 27 ms 24568 KB Output is correct
31 Correct 26 ms 24420 KB Output is correct
32 Correct 26 ms 24568 KB Output is correct
33 Correct 26 ms 24440 KB Output is correct
34 Correct 27 ms 24412 KB Output is correct
35 Correct 299 ms 54708 KB Output is correct
36 Correct 376 ms 67092 KB Output is correct
37 Correct 449 ms 67068 KB Output is correct
38 Correct 391 ms 70264 KB Output is correct
39 Correct 370 ms 55400 KB Output is correct
40 Correct 235 ms 52060 KB Output is correct
41 Correct 681 ms 57148 KB Output is correct
42 Correct 197 ms 51328 KB Output is correct
43 Correct 136 ms 35372 KB Output is correct
44 Correct 478 ms 56392 KB Output is correct
45 Correct 555 ms 61320 KB Output is correct
46 Correct 597 ms 56308 KB Output is correct
47 Correct 640 ms 56312 KB Output is correct
48 Correct 358 ms 55348 KB Output is correct
49 Correct 464 ms 70968 KB Output is correct
50 Correct 582 ms 70404 KB Output is correct
51 Correct 368 ms 57896 KB Output is correct
52 Correct 23 ms 24184 KB Output is correct
53 Correct 733 ms 57336 KB Output is correct
54 Correct 512 ms 56100 KB Output is correct
55 Correct 605 ms 61084 KB Output is correct
56 Correct 636 ms 56568 KB Output is correct
57 Correct 1707 ms 166936 KB Output is correct
58 Correct 2321 ms 244712 KB Output is correct
59 Correct 2855 ms 244612 KB Output is correct
60 Correct 1766 ms 181664 KB Output is correct
61 Correct 4356 ms 177620 KB Output is correct
62 Correct 2902 ms 169416 KB Output is correct
63 Correct 3394 ms 189160 KB Output is correct
64 Correct 3823 ms 179396 KB Output is correct
65 Correct 480 ms 71148 KB Output is correct
66 Correct 525 ms 74360 KB Output is correct
67 Incorrect 394 ms 58636 KB Output isn't correct
68 Halted 0 ms 0 KB -