oj.uz

Submission #123448

# Submission time Handle Problem Language Result Execution time Memory
123448 2019-07-01T12:56:49 Z sebinkim Two Dishes (JOI19_dishes) C++14
74 / 100
 3534 ms 167032 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct fenwick{
	ll T[2020202];
	ll m;
	
	void init(ll _m) { m = _m * 2; }
	
	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{
				x = F.getval(t) - F.getval(t - 1);
				if(x <= Q1[t]){
					if(X.find(t) != X.end()) 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 352 ms 49392 KB Output is correct
2 Correct 336 ms 40296 KB Output is correct
3 Correct 253 ms 39412 KB Output is correct
4 Correct 367 ms 49264 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 336 ms 41324 KB Output is correct
7 Correct 138 ms 34460 KB Output is correct
8 Correct 132 ms 30840 KB Output is correct
9 Correct 260 ms 38756 KB Output is correct
10 Correct 295 ms 45048 KB Output is correct
11 Correct 193 ms 38756 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24056 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 24 ms 24244 KB Output is correct
6 Correct 23 ms 24156 KB Output is correct
7 Correct 22 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24060 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 22 ms 24184 KB Output is correct
12 Correct 23 ms 24184 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 24184 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 22 ms 24056 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 24 ms 24244 KB Output is correct
6 Correct 23 ms 24156 KB Output is correct
7 Correct 22 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24060 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 22 ms 24184 KB Output is correct
12 Correct 23 ms 24184 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 24184 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24356 KB Output is correct
20 Correct 25 ms 24440 KB Output is correct
21 Correct 26 ms 24400 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 22 ms 24056 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 24 ms 24244 KB Output is correct
6 Correct 23 ms 24156 KB Output is correct
7 Correct 22 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24060 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 22 ms 24184 KB Output is correct
12 Correct 23 ms 24184 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 24184 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24356 KB Output is correct
20 Correct 25 ms 24440 KB Output is correct
21 Correct 26 ms 24400 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24312 KB Output is correct
24 Correct 272 ms 40452 KB Output is correct
25 Correct 359 ms 49616 KB Output is correct
26 Correct 380 ms 49628 KB Output is correct
27 Correct 362 ms 54464 KB Output is correct
28 Correct 323 ms 41192 KB Output is correct
29 Correct 237 ms 38788 KB Output is correct
30 Correct 561 ms 43072 KB Output is correct
31 Correct 170 ms 40208 KB Output is correct
32 Correct 126 ms 30968 KB Output is correct
33 Correct 409 ms 42032 KB Output is correct
34 Correct 478 ms 45556 KB Output is correct
35 Correct 494 ms 43108 KB Output is correct
36 Correct 497 ms 43128 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24056 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 24 ms 24244 KB Output is correct
6 Correct 23 ms 24156 KB Output is correct
7 Correct 22 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24060 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 22 ms 24184 KB Output is correct
12 Correct 23 ms 24184 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 24184 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24356 KB Output is correct
20 Correct 25 ms 24440 KB Output is correct
21 Correct 26 ms 24400 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24312 KB Output is correct
24 Correct 272 ms 40452 KB Output is correct
25 Correct 359 ms 49616 KB Output is correct
26 Correct 380 ms 49628 KB Output is correct
27 Correct 362 ms 54464 KB Output is correct
28 Correct 323 ms 41192 KB Output is correct
29 Correct 237 ms 38788 KB Output is correct
30 Correct 561 ms 43072 KB Output is correct
31 Correct 170 ms 40208 KB Output is correct
32 Correct 126 ms 30968 KB Output is correct
33 Correct 409 ms 42032 KB Output is correct
34 Correct 478 ms 45556 KB Output is correct
35 Correct 494 ms 43108 KB Output is correct
36 Correct 497 ms 43128 KB Output is correct
37 Correct 314 ms 40304 KB Output is correct
38 Correct 393 ms 54264 KB Output is correct
39 Correct 473 ms 54392 KB Output is correct
40 Correct 314 ms 45048 KB Output is correct
41 Correct 23 ms 24184 KB Output is correct
42 Correct 606 ms 42872 KB Output is correct
43 Correct 452 ms 41832 KB Output is correct
44 Correct 531 ms 45428 KB Output is correct
45 Correct 542 ms 43008 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24056 KB Output is correct
2 Correct 23 ms 24184 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24056 KB Output is correct
5 Correct 24 ms 24244 KB Output is correct
6 Correct 23 ms 24156 KB Output is correct
7 Correct 22 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24060 KB Output is correct
10 Correct 22 ms 24184 KB Output is correct
11 Correct 22 ms 24184 KB Output is correct
12 Correct 23 ms 24184 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 24184 KB Output is correct
16 Correct 23 ms 24056 KB Output is correct
17 Correct 25 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24356 KB Output is correct
20 Correct 25 ms 24440 KB Output is correct
21 Correct 26 ms 24400 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24312 KB Output is correct
24 Correct 272 ms 40452 KB Output is correct
25 Correct 359 ms 49616 KB Output is correct
26 Correct 380 ms 49628 KB Output is correct
27 Correct 362 ms 54464 KB Output is correct
28 Correct 323 ms 41192 KB Output is correct
29 Correct 237 ms 38788 KB Output is correct
30 Correct 561 ms 43072 KB Output is correct
31 Correct 170 ms 40208 KB Output is correct
32 Correct 126 ms 30968 KB Output is correct
33 Correct 409 ms 42032 KB Output is correct
34 Correct 478 ms 45556 KB Output is correct
35 Correct 494 ms 43108 KB Output is correct
36 Correct 497 ms 43128 KB Output is correct
37 Correct 314 ms 40304 KB Output is correct
38 Correct 393 ms 54264 KB Output is correct
39 Correct 473 ms 54392 KB Output is correct
40 Correct 314 ms 45048 KB Output is correct
41 Correct 23 ms 24184 KB Output is correct
42 Correct 606 ms 42872 KB Output is correct
43 Correct 452 ms 41832 KB Output is correct
44 Correct 531 ms 45428 KB Output is correct
45 Correct 542 ms 43008 KB Output is correct
46 Correct 1515 ms 97168 KB Output is correct
47 Correct 2039 ms 166904 KB Output is correct
48 Correct 2595 ms 167032 KB Output is correct
49 Correct 1515 ms 120052 KB Output is correct
50 Correct 3534 ms 110288 KB Output is correct
51 Correct 2356 ms 103516 KB Output is correct
52 Correct 2795 ms 119032 KB Output is correct
53 Correct 3051 ms 110704 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 49392 KB Output is correct
2 Correct 336 ms 40296 KB Output is correct
3 Correct 253 ms 39412 KB Output is correct
4 Correct 367 ms 49264 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 336 ms 41324 KB Output is correct
7 Correct 138 ms 34460 KB Output is correct
8 Correct 132 ms 30840 KB Output is correct
9 Correct 260 ms 38756 KB Output is correct
10 Correct 295 ms 45048 KB Output is correct
11 Correct 193 ms 38756 KB Output is correct
12 Correct 22 ms 24056 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 24056 KB Output is correct
16 Correct 24 ms 24244 KB Output is correct
17 Correct 23 ms 24156 KB Output is correct
18 Correct 22 ms 24056 KB Output is correct
19 Correct 23 ms 24056 KB Output is correct
20 Correct 23 ms 24060 KB Output is correct
21 Correct 22 ms 24184 KB Output is correct
22 Correct 22 ms 24184 KB Output is correct
23 Correct 23 ms 24184 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 24184 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 25 ms 24312 KB Output is correct
29 Correct 26 ms 24440 KB Output is correct
30 Correct 27 ms 24356 KB Output is correct
31 Correct 25 ms 24440 KB Output is correct
32 Correct 26 ms 24400 KB Output is correct
33 Correct 26 ms 24312 KB Output is correct
34 Correct 26 ms 24312 KB Output is correct
35 Correct 272 ms 40452 KB Output is correct
36 Correct 359 ms 49616 KB Output is correct
37 Correct 380 ms 49628 KB Output is correct
38 Correct 362 ms 54464 KB Output is correct
39 Correct 323 ms 41192 KB Output is correct
40 Correct 237 ms 38788 KB Output is correct
41 Correct 561 ms 43072 KB Output is correct
42 Correct 170 ms 40208 KB Output is correct
43 Correct 126 ms 30968 KB Output is correct
44 Correct 409 ms 42032 KB Output is correct
45 Correct 478 ms 45556 KB Output is correct
46 Correct 494 ms 43108 KB Output is correct
47 Correct 497 ms 43128 KB Output is correct
48 Correct 314 ms 40304 KB Output is correct
49 Correct 393 ms 54264 KB Output is correct
50 Correct 473 ms 54392 KB Output is correct
51 Correct 314 ms 45048 KB Output is correct
52 Correct 23 ms 24184 KB Output is correct
53 Correct 606 ms 42872 KB Output is correct
54 Correct 452 ms 41832 KB Output is correct
55 Correct 531 ms 45428 KB Output is correct
56 Correct 542 ms 43008 KB Output is correct
57 Correct 416 ms 51888 KB Output is correct
58 Correct 462 ms 55564 KB Output is correct
59 Incorrect 345 ms 44684 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 49392 KB Output is correct
2 Correct 336 ms 40296 KB Output is correct
3 Correct 253 ms 39412 KB Output is correct
4 Correct 367 ms 49264 KB Output is correct
5 Correct 23 ms 24056 KB Output is correct
6 Correct 336 ms 41324 KB Output is correct
7 Correct 138 ms 34460 KB Output is correct
8 Correct 132 ms 30840 KB Output is correct
9 Correct 260 ms 38756 KB Output is correct
10 Correct 295 ms 45048 KB Output is correct
11 Correct 193 ms 38756 KB Output is correct
12 Correct 22 ms 24056 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 24056 KB Output is correct
16 Correct 24 ms 24244 KB Output is correct
17 Correct 23 ms 24156 KB Output is correct
18 Correct 22 ms 24056 KB Output is correct
19 Correct 23 ms 24056 KB Output is correct
20 Correct 23 ms 24060 KB Output is correct
21 Correct 22 ms 24184 KB Output is correct
22 Correct 22 ms 24184 KB Output is correct
23 Correct 23 ms 24184 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 24184 KB Output is correct
27 Correct 23 ms 24056 KB Output is correct
28 Correct 25 ms 24312 KB Output is correct
29 Correct 26 ms 24440 KB Output is correct
30 Correct 27 ms 24356 KB Output is correct
31 Correct 25 ms 24440 KB Output is correct
32 Correct 26 ms 24400 KB Output is correct
33 Correct 26 ms 24312 KB Output is correct
34 Correct 26 ms 24312 KB Output is correct
35 Correct 272 ms 40452 KB Output is correct
36 Correct 359 ms 49616 KB Output is correct
37 Correct 380 ms 49628 KB Output is correct
38 Correct 362 ms 54464 KB Output is correct
39 Correct 323 ms 41192 KB Output is correct
40 Correct 237 ms 38788 KB Output is correct
41 Correct 561 ms 43072 KB Output is correct
42 Correct 170 ms 40208 KB Output is correct
43 Correct 126 ms 30968 KB Output is correct
44 Correct 409 ms 42032 KB Output is correct
45 Correct 478 ms 45556 KB Output is correct
46 Correct 494 ms 43108 KB Output is correct
47 Correct 497 ms 43128 KB Output is correct
48 Correct 314 ms 40304 KB Output is correct
49 Correct 393 ms 54264 KB Output is correct
50 Correct 473 ms 54392 KB Output is correct
51 Correct 314 ms 45048 KB Output is correct
52 Correct 23 ms 24184 KB Output is correct
53 Correct 606 ms 42872 KB Output is correct
54 Correct 452 ms 41832 KB Output is correct
55 Correct 531 ms 45428 KB Output is correct
56 Correct 542 ms 43008 KB Output is correct
57 Correct 1515 ms 97168 KB Output is correct
58 Correct 2039 ms 166904 KB Output is correct
59 Correct 2595 ms 167032 KB Output is correct
60 Correct 1515 ms 120052 KB Output is correct
61 Correct 3534 ms 110288 KB Output is correct
62 Correct 2356 ms 103516 KB Output is correct
63 Correct 2795 ms 119032 KB Output is correct
64 Correct 3051 ms 110704 KB Output is correct
65 Correct 416 ms 51888 KB Output is correct
66 Correct 462 ms 55564 KB Output is correct
67 Incorrect 345 ms 44684 KB Output isn't correct
68 Halted 0 ms 0 KB -