oj.uz

Submission #123394

# Submission time Handle Problem Language Result Execution time Memory
123394 2019-07-01T10:54:11 Z sebinkim Two Dishes (JOI19_dishes) C++14
74 / 100
 3456 ms 165624 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long 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;
	
	scanf("%lld%lld", &n, &m);
	
	for(i=1; i<=n; i++){
		scanf("%lld%lld%lld", A + i, S + i, P1 + i);
		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", B + i, T + i, Q1 + i);
		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", 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:78:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~~~~
dishes.cpp:81: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, P1 + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:90: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, Q1 + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 49332 KB Output is correct
2 Correct 314 ms 40304 KB Output is correct
3 Correct 250 ms 37652 KB Output is correct
4 Correct 352 ms 47340 KB Output is correct
5 Correct 24 ms 24056 KB Output is correct
6 Correct 323 ms 40148 KB Output is correct
7 Correct 133 ms 33224 KB Output is correct
8 Correct 126 ms 29648 KB Output is correct
9 Correct 250 ms 37732 KB Output is correct
10 Correct 291 ms 43868 KB Output is correct
11 Correct 183 ms 37604 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24188 KB Output is correct
2 Correct 23 ms 24060 KB Output is correct
3 Correct 23 ms 24028 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 23 ms 24184 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 23 ms 24312 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 23 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24184 KB Output is correct
13 Correct 23 ms 24188 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 23 ms 24116 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 24188 KB Output is correct
2 Correct 23 ms 24060 KB Output is correct
3 Correct 23 ms 24028 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 23 ms 24184 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 23 ms 24312 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 23 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24184 KB Output is correct
13 Correct 23 ms 24188 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 23 ms 24116 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24440 KB Output is correct
18 Correct 25 ms 24488 KB Output is correct
19 Correct 26 ms 24312 KB Output is correct
20 Correct 26 ms 24440 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24312 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24188 KB Output is correct
2 Correct 23 ms 24060 KB Output is correct
3 Correct 23 ms 24028 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 23 ms 24184 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 23 ms 24312 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 23 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24184 KB Output is correct
13 Correct 23 ms 24188 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 23 ms 24116 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24440 KB Output is correct
18 Correct 25 ms 24488 KB Output is correct
19 Correct 26 ms 24312 KB Output is correct
20 Correct 26 ms 24440 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24312 KB Output is correct
24 Correct 263 ms 39352 KB Output is correct
25 Correct 322 ms 48544 KB Output is correct
26 Correct 370 ms 48504 KB Output is correct
27 Correct 421 ms 53244 KB Output is correct
28 Correct 316 ms 40168 KB Output is correct
29 Correct 208 ms 37604 KB Output is correct
30 Correct 551 ms 42040 KB Output is correct
31 Correct 164 ms 39052 KB Output is correct
32 Correct 121 ms 29560 KB Output is correct
33 Correct 391 ms 40876 KB Output is correct
34 Correct 464 ms 44368 KB Output is correct
35 Correct 481 ms 41828 KB Output is correct
36 Correct 485 ms 41848 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24188 KB Output is correct
2 Correct 23 ms 24060 KB Output is correct
3 Correct 23 ms 24028 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 23 ms 24184 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 23 ms 24312 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 23 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24184 KB Output is correct
13 Correct 23 ms 24188 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 23 ms 24116 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24440 KB Output is correct
18 Correct 25 ms 24488 KB Output is correct
19 Correct 26 ms 24312 KB Output is correct
20 Correct 26 ms 24440 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24312 KB Output is correct
24 Correct 263 ms 39352 KB Output is correct
25 Correct 322 ms 48544 KB Output is correct
26 Correct 370 ms 48504 KB Output is correct
27 Correct 421 ms 53244 KB Output is correct
28 Correct 316 ms 40168 KB Output is correct
29 Correct 208 ms 37604 KB Output is correct
30 Correct 551 ms 42040 KB Output is correct
31 Correct 164 ms 39052 KB Output is correct
32 Correct 121 ms 29560 KB Output is correct
33 Correct 391 ms 40876 KB Output is correct
34 Correct 464 ms 44368 KB Output is correct
35 Correct 481 ms 41828 KB Output is correct
36 Correct 485 ms 41848 KB Output is correct
37 Correct 313 ms 39292 KB Output is correct
38 Correct 383 ms 53240 KB Output is correct
39 Correct 466 ms 53304 KB Output is correct
40 Correct 309 ms 43892 KB Output is correct
41 Correct 27 ms 24184 KB Output is correct
42 Correct 591 ms 41848 KB Output is correct
43 Correct 427 ms 40808 KB Output is correct
44 Correct 508 ms 44388 KB Output is correct
45 Correct 575 ms 41860 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24188 KB Output is correct
2 Correct 23 ms 24060 KB Output is correct
3 Correct 23 ms 24028 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 23 ms 24184 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 23 ms 24312 KB Output is correct
9 Correct 23 ms 24184 KB Output is correct
10 Correct 23 ms 24184 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24184 KB Output is correct
13 Correct 23 ms 24188 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 23 ms 24116 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24440 KB Output is correct
18 Correct 25 ms 24488 KB Output is correct
19 Correct 26 ms 24312 KB Output is correct
20 Correct 26 ms 24440 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24312 KB Output is correct
24 Correct 263 ms 39352 KB Output is correct
25 Correct 322 ms 48544 KB Output is correct
26 Correct 370 ms 48504 KB Output is correct
27 Correct 421 ms 53244 KB Output is correct
28 Correct 316 ms 40168 KB Output is correct
29 Correct 208 ms 37604 KB Output is correct
30 Correct 551 ms 42040 KB Output is correct
31 Correct 164 ms 39052 KB Output is correct
32 Correct 121 ms 29560 KB Output is correct
33 Correct 391 ms 40876 KB Output is correct
34 Correct 464 ms 44368 KB Output is correct
35 Correct 481 ms 41828 KB Output is correct
36 Correct 485 ms 41848 KB Output is correct
37 Correct 313 ms 39292 KB Output is correct
38 Correct 383 ms 53240 KB Output is correct
39 Correct 466 ms 53304 KB Output is correct
40 Correct 309 ms 43892 KB Output is correct
41 Correct 27 ms 24184 KB Output is correct
42 Correct 591 ms 41848 KB Output is correct
43 Correct 427 ms 40808 KB Output is correct
44 Correct 508 ms 44388 KB Output is correct
45 Correct 575 ms 41860 KB Output is correct
46 Correct 1435 ms 95540 KB Output is correct
47 Correct 2173 ms 165444 KB Output is correct
48 Correct 2831 ms 165624 KB Output is correct
49 Correct 1451 ms 118692 KB Output is correct
50 Correct 3456 ms 108848 KB Output is correct
51 Correct 2291 ms 102244 KB Output is correct
52 Correct 2844 ms 117704 KB Output is correct
53 Correct 3115 ms 108912 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 49332 KB Output is correct
2 Correct 314 ms 40304 KB Output is correct
3 Correct 250 ms 37652 KB Output is correct
4 Correct 352 ms 47340 KB Output is correct
5 Correct 24 ms 24056 KB Output is correct
6 Correct 323 ms 40148 KB Output is correct
7 Correct 133 ms 33224 KB Output is correct
8 Correct 126 ms 29648 KB Output is correct
9 Correct 250 ms 37732 KB Output is correct
10 Correct 291 ms 43868 KB Output is correct
11 Correct 183 ms 37604 KB Output is correct
12 Correct 23 ms 24188 KB Output is correct
13 Correct 23 ms 24060 KB Output is correct
14 Correct 23 ms 24028 KB Output is correct
15 Correct 23 ms 24056 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 23 ms 24184 KB Output is correct
18 Correct 23 ms 24184 KB Output is correct
19 Correct 23 ms 24312 KB Output is correct
20 Correct 23 ms 24184 KB Output is correct
21 Correct 23 ms 24184 KB Output is correct
22 Correct 23 ms 24184 KB Output is correct
23 Correct 23 ms 24184 KB Output is correct
24 Correct 23 ms 24188 KB Output is correct
25 Correct 23 ms 24056 KB Output is correct
26 Correct 23 ms 24116 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 25 ms 24440 KB Output is correct
29 Correct 25 ms 24488 KB Output is correct
30 Correct 26 ms 24312 KB Output is correct
31 Correct 26 ms 24440 KB Output is correct
32 Correct 26 ms 24440 KB Output is correct
33 Correct 26 ms 24312 KB Output is correct
34 Correct 26 ms 24312 KB Output is correct
35 Correct 263 ms 39352 KB Output is correct
36 Correct 322 ms 48544 KB Output is correct
37 Correct 370 ms 48504 KB Output is correct
38 Correct 421 ms 53244 KB Output is correct
39 Correct 316 ms 40168 KB Output is correct
40 Correct 208 ms 37604 KB Output is correct
41 Correct 551 ms 42040 KB Output is correct
42 Correct 164 ms 39052 KB Output is correct
43 Correct 121 ms 29560 KB Output is correct
44 Correct 391 ms 40876 KB Output is correct
45 Correct 464 ms 44368 KB Output is correct
46 Correct 481 ms 41828 KB Output is correct
47 Correct 485 ms 41848 KB Output is correct
48 Correct 313 ms 39292 KB Output is correct
49 Correct 383 ms 53240 KB Output is correct
50 Correct 466 ms 53304 KB Output is correct
51 Correct 309 ms 43892 KB Output is correct
52 Correct 27 ms 24184 KB Output is correct
53 Correct 591 ms 41848 KB Output is correct
54 Correct 427 ms 40808 KB Output is correct
55 Correct 508 ms 44388 KB Output is correct
56 Correct 575 ms 41860 KB Output is correct
57 Correct 409 ms 49980 KB Output is correct
58 Correct 451 ms 54744 KB Output is correct
59 Incorrect 315 ms 43688 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 49332 KB Output is correct
2 Correct 314 ms 40304 KB Output is correct
3 Correct 250 ms 37652 KB Output is correct
4 Correct 352 ms 47340 KB Output is correct
5 Correct 24 ms 24056 KB Output is correct
6 Correct 323 ms 40148 KB Output is correct
7 Correct 133 ms 33224 KB Output is correct
8 Correct 126 ms 29648 KB Output is correct
9 Correct 250 ms 37732 KB Output is correct
10 Correct 291 ms 43868 KB Output is correct
11 Correct 183 ms 37604 KB Output is correct
12 Correct 23 ms 24188 KB Output is correct
13 Correct 23 ms 24060 KB Output is correct
14 Correct 23 ms 24028 KB Output is correct
15 Correct 23 ms 24056 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 23 ms 24184 KB Output is correct
18 Correct 23 ms 24184 KB Output is correct
19 Correct 23 ms 24312 KB Output is correct
20 Correct 23 ms 24184 KB Output is correct
21 Correct 23 ms 24184 KB Output is correct
22 Correct 23 ms 24184 KB Output is correct
23 Correct 23 ms 24184 KB Output is correct
24 Correct 23 ms 24188 KB Output is correct
25 Correct 23 ms 24056 KB Output is correct
26 Correct 23 ms 24116 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 25 ms 24440 KB Output is correct
29 Correct 25 ms 24488 KB Output is correct
30 Correct 26 ms 24312 KB Output is correct
31 Correct 26 ms 24440 KB Output is correct
32 Correct 26 ms 24440 KB Output is correct
33 Correct 26 ms 24312 KB Output is correct
34 Correct 26 ms 24312 KB Output is correct
35 Correct 263 ms 39352 KB Output is correct
36 Correct 322 ms 48544 KB Output is correct
37 Correct 370 ms 48504 KB Output is correct
38 Correct 421 ms 53244 KB Output is correct
39 Correct 316 ms 40168 KB Output is correct
40 Correct 208 ms 37604 KB Output is correct
41 Correct 551 ms 42040 KB Output is correct
42 Correct 164 ms 39052 KB Output is correct
43 Correct 121 ms 29560 KB Output is correct
44 Correct 391 ms 40876 KB Output is correct
45 Correct 464 ms 44368 KB Output is correct
46 Correct 481 ms 41828 KB Output is correct
47 Correct 485 ms 41848 KB Output is correct
48 Correct 313 ms 39292 KB Output is correct
49 Correct 383 ms 53240 KB Output is correct
50 Correct 466 ms 53304 KB Output is correct
51 Correct 309 ms 43892 KB Output is correct
52 Correct 27 ms 24184 KB Output is correct
53 Correct 591 ms 41848 KB Output is correct
54 Correct 427 ms 40808 KB Output is correct
55 Correct 508 ms 44388 KB Output is correct
56 Correct 575 ms 41860 KB Output is correct
57 Correct 1435 ms 95540 KB Output is correct
58 Correct 2173 ms 165444 KB Output is correct
59 Correct 2831 ms 165624 KB Output is correct
60 Correct 1451 ms 118692 KB Output is correct
61 Correct 3456 ms 108848 KB Output is correct
62 Correct 2291 ms 102244 KB Output is correct
63 Correct 2844 ms 117704 KB Output is correct
64 Correct 3115 ms 108912 KB Output is correct
65 Correct 409 ms 49980 KB Output is correct
66 Correct 451 ms 54744 KB Output is correct
67 Incorrect 315 ms 43688 KB Output isn't correct
68 Halted 0 ms 0 KB -