oj.uz

Submission #123425

# Submission time Handle Problem Language Result Execution time Memory
123425 2019-07-01T12:28:01 Z sebinkim Two Dishes (JOI19_dishes) C++14
74 / 100
 3688 ms 166648 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{
				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 344 ms 54528 KB Output is correct
2 Correct 321 ms 45556 KB Output is correct
3 Correct 244 ms 42596 KB Output is correct
4 Correct 354 ms 52076 KB Output is correct
5 Correct 23 ms 24188 KB Output is correct
6 Correct 323 ms 45168 KB Output is correct
7 Correct 133 ms 35556 KB Output is correct
8 Correct 131 ms 31912 KB Output is correct
9 Correct 253 ms 43712 KB Output is correct
10 Correct 288 ms 46060 KB Output is correct
11 Correct 185 ms 40348 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 22 ms 24188 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24132 KB Output is correct
5 Correct 23 ms 24184 KB Output is correct
6 Correct 23 ms 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 24 ms 24124 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 24 ms 24184 KB Output is correct
16 Correct 23 ms 24184 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 22 ms 24188 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24132 KB Output is correct
5 Correct 23 ms 24184 KB Output is correct
6 Correct 23 ms 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 24 ms 24124 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 24 ms 24184 KB Output is correct
16 Correct 23 ms 24184 KB Output is correct
17 Correct 26 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24412 KB Output is correct
20 Correct 25 ms 24312 KB Output is correct
21 Correct 27 ms 24444 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24284 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 22 ms 24188 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24132 KB Output is correct
5 Correct 23 ms 24184 KB Output is correct
6 Correct 23 ms 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 24 ms 24124 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 24 ms 24184 KB Output is correct
16 Correct 23 ms 24184 KB Output is correct
17 Correct 26 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24412 KB Output is correct
20 Correct 25 ms 24312 KB Output is correct
21 Correct 27 ms 24444 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24284 KB Output is correct
24 Correct 257 ms 43272 KB Output is correct
25 Correct 348 ms 51684 KB Output is correct
26 Correct 372 ms 51320 KB Output is correct
27 Correct 350 ms 55928 KB Output is correct
28 Correct 330 ms 42984 KB Output is correct
29 Correct 210 ms 40676 KB Output is correct
30 Correct 559 ms 44408 KB Output is correct
31 Correct 166 ms 40852 KB Output is correct
32 Correct 122 ms 31432 KB Output is correct
33 Correct 401 ms 43688 KB Output is correct
34 Correct 522 ms 47388 KB Output is correct
35 Correct 493 ms 43128 KB Output is correct
36 Correct 487 ms 43148 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 22 ms 24188 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24132 KB Output is correct
5 Correct 23 ms 24184 KB Output is correct
6 Correct 23 ms 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 24 ms 24124 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 24 ms 24184 KB Output is correct
16 Correct 23 ms 24184 KB Output is correct
17 Correct 26 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24412 KB Output is correct
20 Correct 25 ms 24312 KB Output is correct
21 Correct 27 ms 24444 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24284 KB Output is correct
24 Correct 257 ms 43272 KB Output is correct
25 Correct 348 ms 51684 KB Output is correct
26 Correct 372 ms 51320 KB Output is correct
27 Correct 350 ms 55928 KB Output is correct
28 Correct 330 ms 42984 KB Output is correct
29 Correct 210 ms 40676 KB Output is correct
30 Correct 559 ms 44408 KB Output is correct
31 Correct 166 ms 40852 KB Output is correct
32 Correct 122 ms 31432 KB Output is correct
33 Correct 401 ms 43688 KB Output is correct
34 Correct 522 ms 47388 KB Output is correct
35 Correct 493 ms 43128 KB Output is correct
36 Correct 487 ms 43148 KB Output is correct
37 Correct 302 ms 41736 KB Output is correct
38 Correct 385 ms 55520 KB Output is correct
39 Correct 482 ms 54992 KB Output is correct
40 Correct 308 ms 45808 KB Output is correct
41 Correct 23 ms 24056 KB Output is correct
42 Correct 647 ms 43660 KB Output is correct
43 Correct 434 ms 42216 KB Output is correct
44 Correct 507 ms 45684 KB Output is correct
45 Correct 529 ms 42592 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 22 ms 24188 KB Output is correct
3 Correct 23 ms 24184 KB Output is correct
4 Correct 23 ms 24132 KB Output is correct
5 Correct 23 ms 24184 KB Output is correct
6 Correct 23 ms 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24056 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24056 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 24 ms 24124 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 24 ms 24184 KB Output is correct
16 Correct 23 ms 24184 KB Output is correct
17 Correct 26 ms 24312 KB Output is correct
18 Correct 26 ms 24440 KB Output is correct
19 Correct 27 ms 24412 KB Output is correct
20 Correct 25 ms 24312 KB Output is correct
21 Correct 27 ms 24444 KB Output is correct
22 Correct 26 ms 24312 KB Output is correct
23 Correct 26 ms 24284 KB Output is correct
24 Correct 257 ms 43272 KB Output is correct
25 Correct 348 ms 51684 KB Output is correct
26 Correct 372 ms 51320 KB Output is correct
27 Correct 350 ms 55928 KB Output is correct
28 Correct 330 ms 42984 KB Output is correct
29 Correct 210 ms 40676 KB Output is correct
30 Correct 559 ms 44408 KB Output is correct
31 Correct 166 ms 40852 KB Output is correct
32 Correct 122 ms 31432 KB Output is correct
33 Correct 401 ms 43688 KB Output is correct
34 Correct 522 ms 47388 KB Output is correct
35 Correct 493 ms 43128 KB Output is correct
36 Correct 487 ms 43148 KB Output is correct
37 Correct 302 ms 41736 KB Output is correct
38 Correct 385 ms 55520 KB Output is correct
39 Correct 482 ms 54992 KB Output is correct
40 Correct 308 ms 45808 KB Output is correct
41 Correct 23 ms 24056 KB Output is correct
42 Correct 647 ms 43660 KB Output is correct
43 Correct 434 ms 42216 KB Output is correct
44 Correct 507 ms 45684 KB Output is correct
45 Correct 529 ms 42592 KB Output is correct
46 Correct 1449 ms 96384 KB Output is correct
47 Correct 1959 ms 166172 KB Output is correct
48 Correct 2583 ms 166648 KB Output is correct
49 Correct 1431 ms 119684 KB Output is correct
50 Correct 3688 ms 109628 KB Output is correct
51 Correct 2316 ms 102908 KB Output is correct
52 Correct 2837 ms 118308 KB Output is correct
53 Correct 3086 ms 110852 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 54528 KB Output is correct
2 Correct 321 ms 45556 KB Output is correct
3 Correct 244 ms 42596 KB Output is correct
4 Correct 354 ms 52076 KB Output is correct
5 Correct 23 ms 24188 KB Output is correct
6 Correct 323 ms 45168 KB Output is correct
7 Correct 133 ms 35556 KB Output is correct
8 Correct 131 ms 31912 KB Output is correct
9 Correct 253 ms 43712 KB Output is correct
10 Correct 288 ms 46060 KB Output is correct
11 Correct 185 ms 40348 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 22 ms 24188 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 23 ms 24132 KB Output is correct
16 Correct 23 ms 24184 KB Output is correct
17 Correct 23 ms 24056 KB Output is correct
18 Correct 23 ms 24056 KB Output is correct
19 Correct 23 ms 24056 KB Output is correct
20 Correct 23 ms 24056 KB Output is correct
21 Correct 23 ms 24056 KB Output is correct
22 Correct 23 ms 24184 KB Output is correct
23 Correct 23 ms 24056 KB Output is correct
24 Correct 24 ms 24124 KB Output is correct
25 Correct 23 ms 24184 KB Output is correct
26 Correct 24 ms 24184 KB Output is correct
27 Correct 23 ms 24184 KB Output is correct
28 Correct 26 ms 24312 KB Output is correct
29 Correct 26 ms 24440 KB Output is correct
30 Correct 27 ms 24412 KB Output is correct
31 Correct 25 ms 24312 KB Output is correct
32 Correct 27 ms 24444 KB Output is correct
33 Correct 26 ms 24312 KB Output is correct
34 Correct 26 ms 24284 KB Output is correct
35 Correct 257 ms 43272 KB Output is correct
36 Correct 348 ms 51684 KB Output is correct
37 Correct 372 ms 51320 KB Output is correct
38 Correct 350 ms 55928 KB Output is correct
39 Correct 330 ms 42984 KB Output is correct
40 Correct 210 ms 40676 KB Output is correct
41 Correct 559 ms 44408 KB Output is correct
42 Correct 166 ms 40852 KB Output is correct
43 Correct 122 ms 31432 KB Output is correct
44 Correct 401 ms 43688 KB Output is correct
45 Correct 522 ms 47388 KB Output is correct
46 Correct 493 ms 43128 KB Output is correct
47 Correct 487 ms 43148 KB Output is correct
48 Correct 302 ms 41736 KB Output is correct
49 Correct 385 ms 55520 KB Output is correct
50 Correct 482 ms 54992 KB Output is correct
51 Correct 308 ms 45808 KB Output is correct
52 Correct 23 ms 24056 KB Output is correct
53 Correct 647 ms 43660 KB Output is correct
54 Correct 434 ms 42216 KB Output is correct
55 Correct 507 ms 45684 KB Output is correct
56 Correct 529 ms 42592 KB Output is correct
57 Correct 414 ms 52024 KB Output is correct
58 Correct 456 ms 56724 KB Output is correct
59 Incorrect 335 ms 44664 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 54528 KB Output is correct
2 Correct 321 ms 45556 KB Output is correct
3 Correct 244 ms 42596 KB Output is correct
4 Correct 354 ms 52076 KB Output is correct
5 Correct 23 ms 24188 KB Output is correct
6 Correct 323 ms 45168 KB Output is correct
7 Correct 133 ms 35556 KB Output is correct
8 Correct 131 ms 31912 KB Output is correct
9 Correct 253 ms 43712 KB Output is correct
10 Correct 288 ms 46060 KB Output is correct
11 Correct 185 ms 40348 KB Output is correct
12 Correct 23 ms 24056 KB Output is correct
13 Correct 22 ms 24188 KB Output is correct
14 Correct 23 ms 24184 KB Output is correct
15 Correct 23 ms 24132 KB Output is correct
16 Correct 23 ms 24184 KB Output is correct
17 Correct 23 ms 24056 KB Output is correct
18 Correct 23 ms 24056 KB Output is correct
19 Correct 23 ms 24056 KB Output is correct
20 Correct 23 ms 24056 KB Output is correct
21 Correct 23 ms 24056 KB Output is correct
22 Correct 23 ms 24184 KB Output is correct
23 Correct 23 ms 24056 KB Output is correct
24 Correct 24 ms 24124 KB Output is correct
25 Correct 23 ms 24184 KB Output is correct
26 Correct 24 ms 24184 KB Output is correct
27 Correct 23 ms 24184 KB Output is correct
28 Correct 26 ms 24312 KB Output is correct
29 Correct 26 ms 24440 KB Output is correct
30 Correct 27 ms 24412 KB Output is correct
31 Correct 25 ms 24312 KB Output is correct
32 Correct 27 ms 24444 KB Output is correct
33 Correct 26 ms 24312 KB Output is correct
34 Correct 26 ms 24284 KB Output is correct
35 Correct 257 ms 43272 KB Output is correct
36 Correct 348 ms 51684 KB Output is correct
37 Correct 372 ms 51320 KB Output is correct
38 Correct 350 ms 55928 KB Output is correct
39 Correct 330 ms 42984 KB Output is correct
40 Correct 210 ms 40676 KB Output is correct
41 Correct 559 ms 44408 KB Output is correct
42 Correct 166 ms 40852 KB Output is correct
43 Correct 122 ms 31432 KB Output is correct
44 Correct 401 ms 43688 KB Output is correct
45 Correct 522 ms 47388 KB Output is correct
46 Correct 493 ms 43128 KB Output is correct
47 Correct 487 ms 43148 KB Output is correct
48 Correct 302 ms 41736 KB Output is correct
49 Correct 385 ms 55520 KB Output is correct
50 Correct 482 ms 54992 KB Output is correct
51 Correct 308 ms 45808 KB Output is correct
52 Correct 23 ms 24056 KB Output is correct
53 Correct 647 ms 43660 KB Output is correct
54 Correct 434 ms 42216 KB Output is correct
55 Correct 507 ms 45684 KB Output is correct
56 Correct 529 ms 42592 KB Output is correct
57 Correct 1449 ms 96384 KB Output is correct
58 Correct 1959 ms 166172 KB Output is correct
59 Correct 2583 ms 166648 KB Output is correct
60 Correct 1431 ms 119684 KB Output is correct
61 Correct 3688 ms 109628 KB Output is correct
62 Correct 2316 ms 102908 KB Output is correct
63 Correct 2837 ms 118308 KB Output is correct
64 Correct 3086 ms 110852 KB Output is correct
65 Correct 414 ms 52024 KB Output is correct
66 Correct 456 ms 56724 KB Output is correct
67 Incorrect 335 ms 44664 KB Output isn't correct
68 Halted 0 ms 0 KB -