oj.uz

Submission #123389

# Submission time Handle Problem Language Result Execution time Memory
123389 2019-07-01T10:37:49 Z sebinkim Two Dishes (JOI19_dishes) C++14
74 / 100
 2960 ms 166712 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(P2[i] == 0){
			if(S[i]) query(0, S[i] - 1, P1[i]);
		}
		else{
			if(S[i] && S[i] <= m) query(1, S[i], P2[i]);
			else F.addval(0, 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 343 ms 51184 KB Output is correct
2 Correct 289 ms 43124 KB Output is correct
3 Correct 246 ms 38884 KB Output is correct
4 Correct 342 ms 49136 KB Output is correct
5 Correct 28 ms 24056 KB Output is correct
6 Correct 299 ms 41960 KB Output is correct
7 Correct 136 ms 34404 KB Output is correct
8 Correct 130 ms 31068 KB Output is correct
9 Correct 255 ms 39488 KB Output is correct
10 Correct 257 ms 44920 KB Output is correct
11 Correct 186 ms 38868 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24260 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 22 ms 24184 KB Output is correct
5 Correct 22 ms 24184 KB Output is correct
6 Correct 28 ms 24060 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 27 ms 24184 KB Output is correct
9 Correct 28 ms 24184 KB Output is correct
10 Correct 24 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 27 ms 24056 KB Output is correct
14 Correct 27 ms 24060 KB Output is correct
15 Correct 24 ms 24056 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 24260 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 22 ms 24184 KB Output is correct
5 Correct 22 ms 24184 KB Output is correct
6 Correct 28 ms 24060 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 27 ms 24184 KB Output is correct
9 Correct 28 ms 24184 KB Output is correct
10 Correct 24 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 27 ms 24056 KB Output is correct
14 Correct 27 ms 24060 KB Output is correct
15 Correct 24 ms 24056 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 24 ms 24440 KB Output is correct
18 Correct 25 ms 24440 KB Output is correct
19 Correct 27 ms 24404 KB Output is correct
20 Correct 26 ms 24312 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 24260 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 22 ms 24184 KB Output is correct
5 Correct 22 ms 24184 KB Output is correct
6 Correct 28 ms 24060 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 27 ms 24184 KB Output is correct
9 Correct 28 ms 24184 KB Output is correct
10 Correct 24 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 27 ms 24056 KB Output is correct
14 Correct 27 ms 24060 KB Output is correct
15 Correct 24 ms 24056 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 24 ms 24440 KB Output is correct
18 Correct 25 ms 24440 KB Output is correct
19 Correct 27 ms 24404 KB Output is correct
20 Correct 26 ms 24312 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 227 ms 40468 KB Output is correct
25 Correct 351 ms 49756 KB Output is correct
26 Correct 240 ms 41324 KB Output is correct
27 Correct 364 ms 55032 KB Output is correct
28 Correct 293 ms 42088 KB Output is correct
29 Correct 210 ms 39524 KB Output is correct
30 Correct 468 ms 43720 KB Output is correct
31 Correct 180 ms 40332 KB Output is correct
32 Correct 114 ms 30880 KB Output is correct
33 Correct 341 ms 41964 KB Output is correct
34 Correct 401 ms 45428 KB Output is correct
35 Correct 378 ms 42360 KB Output is correct
36 Correct 396 ms 42360 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24260 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 22 ms 24184 KB Output is correct
5 Correct 22 ms 24184 KB Output is correct
6 Correct 28 ms 24060 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 27 ms 24184 KB Output is correct
9 Correct 28 ms 24184 KB Output is correct
10 Correct 24 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 27 ms 24056 KB Output is correct
14 Correct 27 ms 24060 KB Output is correct
15 Correct 24 ms 24056 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 24 ms 24440 KB Output is correct
18 Correct 25 ms 24440 KB Output is correct
19 Correct 27 ms 24404 KB Output is correct
20 Correct 26 ms 24312 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 227 ms 40468 KB Output is correct
25 Correct 351 ms 49756 KB Output is correct
26 Correct 240 ms 41324 KB Output is correct
27 Correct 364 ms 55032 KB Output is correct
28 Correct 293 ms 42088 KB Output is correct
29 Correct 210 ms 39524 KB Output is correct
30 Correct 468 ms 43720 KB Output is correct
31 Correct 180 ms 40332 KB Output is correct
32 Correct 114 ms 30880 KB Output is correct
33 Correct 341 ms 41964 KB Output is correct
34 Correct 401 ms 45428 KB Output is correct
35 Correct 378 ms 42360 KB Output is correct
36 Correct 396 ms 42360 KB Output is correct
37 Correct 278 ms 41740 KB Output is correct
38 Correct 390 ms 55800 KB Output is correct
39 Correct 423 ms 55052 KB Output is correct
40 Correct 275 ms 45712 KB Output is correct
41 Correct 22 ms 24056 KB Output is correct
42 Correct 504 ms 44152 KB Output is correct
43 Correct 382 ms 42984 KB Output is correct
44 Correct 448 ms 46552 KB Output is correct
45 Correct 446 ms 42412 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24260 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 22 ms 24184 KB Output is correct
5 Correct 22 ms 24184 KB Output is correct
6 Correct 28 ms 24060 KB Output is correct
7 Correct 23 ms 24184 KB Output is correct
8 Correct 27 ms 24184 KB Output is correct
9 Correct 28 ms 24184 KB Output is correct
10 Correct 24 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 27 ms 24056 KB Output is correct
14 Correct 27 ms 24060 KB Output is correct
15 Correct 24 ms 24056 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 24 ms 24440 KB Output is correct
18 Correct 25 ms 24440 KB Output is correct
19 Correct 27 ms 24404 KB Output is correct
20 Correct 26 ms 24312 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 227 ms 40468 KB Output is correct
25 Correct 351 ms 49756 KB Output is correct
26 Correct 240 ms 41324 KB Output is correct
27 Correct 364 ms 55032 KB Output is correct
28 Correct 293 ms 42088 KB Output is correct
29 Correct 210 ms 39524 KB Output is correct
30 Correct 468 ms 43720 KB Output is correct
31 Correct 180 ms 40332 KB Output is correct
32 Correct 114 ms 30880 KB Output is correct
33 Correct 341 ms 41964 KB Output is correct
34 Correct 401 ms 45428 KB Output is correct
35 Correct 378 ms 42360 KB Output is correct
36 Correct 396 ms 42360 KB Output is correct
37 Correct 278 ms 41740 KB Output is correct
38 Correct 390 ms 55800 KB Output is correct
39 Correct 423 ms 55052 KB Output is correct
40 Correct 275 ms 45712 KB Output is correct
41 Correct 22 ms 24056 KB Output is correct
42 Correct 504 ms 44152 KB Output is correct
43 Correct 382 ms 42984 KB Output is correct
44 Correct 448 ms 46552 KB Output is correct
45 Correct 446 ms 42412 KB Output is correct
46 Correct 1330 ms 96380 KB Output is correct
47 Correct 2176 ms 166628 KB Output is correct
48 Correct 2400 ms 166712 KB Output is correct
49 Correct 1291 ms 119504 KB Output is correct
50 Correct 2960 ms 109148 KB Output is correct
51 Correct 1987 ms 102484 KB Output is correct
52 Correct 2524 ms 118052 KB Output is correct
53 Correct 2442 ms 110960 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 51184 KB Output is correct
2 Correct 289 ms 43124 KB Output is correct
3 Correct 246 ms 38884 KB Output is correct
4 Correct 342 ms 49136 KB Output is correct
5 Correct 28 ms 24056 KB Output is correct
6 Correct 299 ms 41960 KB Output is correct
7 Correct 136 ms 34404 KB Output is correct
8 Correct 130 ms 31068 KB Output is correct
9 Correct 255 ms 39488 KB Output is correct
10 Correct 257 ms 44920 KB Output is correct
11 Correct 186 ms 38868 KB Output is correct
12 Correct 23 ms 24260 KB Output is correct
13 Correct 23 ms 24184 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 22 ms 24184 KB Output is correct
16 Correct 22 ms 24184 KB Output is correct
17 Correct 28 ms 24060 KB Output is correct
18 Correct 23 ms 24184 KB Output is correct
19 Correct 27 ms 24184 KB Output is correct
20 Correct 28 ms 24184 KB Output is correct
21 Correct 24 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 27 ms 24056 KB Output is correct
25 Correct 27 ms 24060 KB Output is correct
26 Correct 24 ms 24056 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 24 ms 24440 KB Output is correct
29 Correct 25 ms 24440 KB Output is correct
30 Correct 27 ms 24404 KB Output is correct
31 Correct 26 ms 24312 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 227 ms 40468 KB Output is correct
36 Correct 351 ms 49756 KB Output is correct
37 Correct 240 ms 41324 KB Output is correct
38 Correct 364 ms 55032 KB Output is correct
39 Correct 293 ms 42088 KB Output is correct
40 Correct 210 ms 39524 KB Output is correct
41 Correct 468 ms 43720 KB Output is correct
42 Correct 180 ms 40332 KB Output is correct
43 Correct 114 ms 30880 KB Output is correct
44 Correct 341 ms 41964 KB Output is correct
45 Correct 401 ms 45428 KB Output is correct
46 Correct 378 ms 42360 KB Output is correct
47 Correct 396 ms 42360 KB Output is correct
48 Correct 278 ms 41740 KB Output is correct
49 Correct 390 ms 55800 KB Output is correct
50 Correct 423 ms 55052 KB Output is correct
51 Correct 275 ms 45712 KB Output is correct
52 Correct 22 ms 24056 KB Output is correct
53 Correct 504 ms 44152 KB Output is correct
54 Correct 382 ms 42984 KB Output is correct
55 Correct 448 ms 46552 KB Output is correct
56 Correct 446 ms 42412 KB Output is correct
57 Correct 377 ms 52424 KB Output is correct
58 Incorrect 451 ms 56976 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 51184 KB Output is correct
2 Correct 289 ms 43124 KB Output is correct
3 Correct 246 ms 38884 KB Output is correct
4 Correct 342 ms 49136 KB Output is correct
5 Correct 28 ms 24056 KB Output is correct
6 Correct 299 ms 41960 KB Output is correct
7 Correct 136 ms 34404 KB Output is correct
8 Correct 130 ms 31068 KB Output is correct
9 Correct 255 ms 39488 KB Output is correct
10 Correct 257 ms 44920 KB Output is correct
11 Correct 186 ms 38868 KB Output is correct
12 Correct 23 ms 24260 KB Output is correct
13 Correct 23 ms 24184 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 22 ms 24184 KB Output is correct
16 Correct 22 ms 24184 KB Output is correct
17 Correct 28 ms 24060 KB Output is correct
18 Correct 23 ms 24184 KB Output is correct
19 Correct 27 ms 24184 KB Output is correct
20 Correct 28 ms 24184 KB Output is correct
21 Correct 24 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 27 ms 24056 KB Output is correct
25 Correct 27 ms 24060 KB Output is correct
26 Correct 24 ms 24056 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 24 ms 24440 KB Output is correct
29 Correct 25 ms 24440 KB Output is correct
30 Correct 27 ms 24404 KB Output is correct
31 Correct 26 ms 24312 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 227 ms 40468 KB Output is correct
36 Correct 351 ms 49756 KB Output is correct
37 Correct 240 ms 41324 KB Output is correct
38 Correct 364 ms 55032 KB Output is correct
39 Correct 293 ms 42088 KB Output is correct
40 Correct 210 ms 39524 KB Output is correct
41 Correct 468 ms 43720 KB Output is correct
42 Correct 180 ms 40332 KB Output is correct
43 Correct 114 ms 30880 KB Output is correct
44 Correct 341 ms 41964 KB Output is correct
45 Correct 401 ms 45428 KB Output is correct
46 Correct 378 ms 42360 KB Output is correct
47 Correct 396 ms 42360 KB Output is correct
48 Correct 278 ms 41740 KB Output is correct
49 Correct 390 ms 55800 KB Output is correct
50 Correct 423 ms 55052 KB Output is correct
51 Correct 275 ms 45712 KB Output is correct
52 Correct 22 ms 24056 KB Output is correct
53 Correct 504 ms 44152 KB Output is correct
54 Correct 382 ms 42984 KB Output is correct
55 Correct 448 ms 46552 KB Output is correct
56 Correct 446 ms 42412 KB Output is correct
57 Correct 1330 ms 96380 KB Output is correct
58 Correct 2176 ms 166628 KB Output is correct
59 Correct 2400 ms 166712 KB Output is correct
60 Correct 1291 ms 119504 KB Output is correct
61 Correct 2960 ms 109148 KB Output is correct
62 Correct 1987 ms 102484 KB Output is correct
63 Correct 2524 ms 118052 KB Output is correct
64 Correct 2442 ms 110960 KB Output is correct
65 Correct 377 ms 52424 KB Output is correct
66 Incorrect 451 ms 56976 KB Output isn't correct
67 Halted 0 ms 0 KB -