oj.uz

Submission #123301

# Submission time Handle Problem Language Result Execution time Memory
123301 2019-07-01T06:30:05 Z 김세빈(#3018) Two Dishes (JOI19_dishes) C++14
74 / 100
 2954 ms 166568 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct fenwick{
	ll T[1010101];
	ll m;
	
	void init(int _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.lower_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) F.addval(i, Q2[i]);
		else 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) continue;
		else if(P2[i] == 0) query(0, S[i], P1[i]);
		else 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 330 ms 52548 KB Output is correct
2 Correct 289 ms 43684 KB Output is correct
3 Correct 246 ms 40144 KB Output is correct
4 Correct 335 ms 49272 KB Output is correct
5 Correct 22 ms 24156 KB Output is correct
6 Correct 297 ms 42088 KB Output is correct
7 Correct 133 ms 34992 KB Output is correct
8 Correct 126 ms 31652 KB Output is correct
9 Correct 253 ms 39656 KB Output is correct
10 Correct 265 ms 45800 KB Output is correct
11 Correct 186 ms 39604 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 24056 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 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24040 KB Output is correct
11 Correct 28 ms 24116 KB Output is correct
12 Correct 28 ms 24056 KB Output is correct
13 Correct 24 ms 24184 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 27 ms 24056 KB Output is correct
16 Correct 27 ms 24060 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 24056 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 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24040 KB Output is correct
11 Correct 28 ms 24116 KB Output is correct
12 Correct 28 ms 24056 KB Output is correct
13 Correct 24 ms 24184 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 27 ms 24056 KB Output is correct
16 Correct 27 ms 24060 KB Output is correct
17 Correct 26 ms 24356 KB Output is correct
18 Correct 25 ms 24444 KB Output is correct
19 Correct 26 ms 24428 KB Output is correct
20 Correct 26 ms 24280 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 27 ms 24316 KB Output is correct
23 Correct 25 ms 24312 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 24056 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 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24040 KB Output is correct
11 Correct 28 ms 24116 KB Output is correct
12 Correct 28 ms 24056 KB Output is correct
13 Correct 24 ms 24184 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 27 ms 24056 KB Output is correct
16 Correct 27 ms 24060 KB Output is correct
17 Correct 26 ms 24356 KB Output is correct
18 Correct 25 ms 24444 KB Output is correct
19 Correct 26 ms 24428 KB Output is correct
20 Correct 26 ms 24280 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 27 ms 24316 KB Output is correct
23 Correct 25 ms 24312 KB Output is correct
24 Correct 234 ms 40728 KB Output is correct
25 Correct 344 ms 52140 KB Output is correct
26 Correct 237 ms 41956 KB Output is correct
27 Correct 374 ms 57652 KB Output is correct
28 Correct 298 ms 44368 KB Output is correct
29 Correct 212 ms 41948 KB Output is correct
30 Correct 482 ms 46456 KB Output is correct
31 Correct 168 ms 40984 KB Output is correct
32 Correct 115 ms 31568 KB Output is correct
33 Correct 344 ms 44148 KB Output is correct
34 Correct 422 ms 47608 KB Output is correct
35 Correct 392 ms 44512 KB Output is correct
36 Correct 403 ms 44436 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 24056 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 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24040 KB Output is correct
11 Correct 28 ms 24116 KB Output is correct
12 Correct 28 ms 24056 KB Output is correct
13 Correct 24 ms 24184 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 27 ms 24056 KB Output is correct
16 Correct 27 ms 24060 KB Output is correct
17 Correct 26 ms 24356 KB Output is correct
18 Correct 25 ms 24444 KB Output is correct
19 Correct 26 ms 24428 KB Output is correct
20 Correct 26 ms 24280 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 27 ms 24316 KB Output is correct
23 Correct 25 ms 24312 KB Output is correct
24 Correct 234 ms 40728 KB Output is correct
25 Correct 344 ms 52140 KB Output is correct
26 Correct 237 ms 41956 KB Output is correct
27 Correct 374 ms 57652 KB Output is correct
28 Correct 298 ms 44368 KB Output is correct
29 Correct 212 ms 41948 KB Output is correct
30 Correct 482 ms 46456 KB Output is correct
31 Correct 168 ms 40984 KB Output is correct
32 Correct 115 ms 31568 KB Output is correct
33 Correct 344 ms 44148 KB Output is correct
34 Correct 422 ms 47608 KB Output is correct
35 Correct 392 ms 44512 KB Output is correct
36 Correct 403 ms 44436 KB Output is correct
37 Correct 282 ms 42000 KB Output is correct
38 Correct 388 ms 57592 KB Output is correct
39 Correct 426 ms 58092 KB Output is correct
40 Correct 279 ms 48760 KB Output is correct
41 Correct 23 ms 24156 KB Output is correct
42 Correct 514 ms 45432 KB Output is correct
43 Correct 388 ms 44264 KB Output is correct
44 Correct 460 ms 47988 KB Output is correct
45 Correct 432 ms 44896 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 24056 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 24056 KB Output is correct
7 Correct 23 ms 24056 KB Output is correct
8 Correct 23 ms 24184 KB Output is correct
9 Correct 23 ms 24056 KB Output is correct
10 Correct 23 ms 24040 KB Output is correct
11 Correct 28 ms 24116 KB Output is correct
12 Correct 28 ms 24056 KB Output is correct
13 Correct 24 ms 24184 KB Output is correct
14 Correct 23 ms 24056 KB Output is correct
15 Correct 27 ms 24056 KB Output is correct
16 Correct 27 ms 24060 KB Output is correct
17 Correct 26 ms 24356 KB Output is correct
18 Correct 25 ms 24444 KB Output is correct
19 Correct 26 ms 24428 KB Output is correct
20 Correct 26 ms 24280 KB Output is correct
21 Correct 26 ms 24440 KB Output is correct
22 Correct 27 ms 24316 KB Output is correct
23 Correct 25 ms 24312 KB Output is correct
24 Correct 234 ms 40728 KB Output is correct
25 Correct 344 ms 52140 KB Output is correct
26 Correct 237 ms 41956 KB Output is correct
27 Correct 374 ms 57652 KB Output is correct
28 Correct 298 ms 44368 KB Output is correct
29 Correct 212 ms 41948 KB Output is correct
30 Correct 482 ms 46456 KB Output is correct
31 Correct 168 ms 40984 KB Output is correct
32 Correct 115 ms 31568 KB Output is correct
33 Correct 344 ms 44148 KB Output is correct
34 Correct 422 ms 47608 KB Output is correct
35 Correct 392 ms 44512 KB Output is correct
36 Correct 403 ms 44436 KB Output is correct
37 Correct 282 ms 42000 KB Output is correct
38 Correct 388 ms 57592 KB Output is correct
39 Correct 426 ms 58092 KB Output is correct
40 Correct 279 ms 48760 KB Output is correct
41 Correct 23 ms 24156 KB Output is correct
42 Correct 514 ms 45432 KB Output is correct
43 Correct 388 ms 44264 KB Output is correct
44 Correct 460 ms 47988 KB Output is correct
45 Correct 432 ms 44896 KB Output is correct
46 Correct 1334 ms 90284 KB Output is correct
47 Correct 2009 ms 166568 KB Output is correct
48 Correct 2274 ms 166204 KB Output is correct
49 Correct 1476 ms 119164 KB Output is correct
50 Correct 2954 ms 109228 KB Output is correct
51 Correct 2096 ms 102620 KB Output is correct
52 Correct 2569 ms 118216 KB Output is correct
53 Correct 2612 ms 113148 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 52548 KB Output is correct
2 Correct 289 ms 43684 KB Output is correct
3 Correct 246 ms 40144 KB Output is correct
4 Correct 335 ms 49272 KB Output is correct
5 Correct 22 ms 24156 KB Output is correct
6 Correct 297 ms 42088 KB Output is correct
7 Correct 133 ms 34992 KB Output is correct
8 Correct 126 ms 31652 KB Output is correct
9 Correct 253 ms 39656 KB Output is correct
10 Correct 265 ms 45800 KB Output is correct
11 Correct 186 ms 39604 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 24056 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 24056 KB Output is correct
18 Correct 23 ms 24056 KB Output is correct
19 Correct 23 ms 24184 KB Output is correct
20 Correct 23 ms 24056 KB Output is correct
21 Correct 23 ms 24040 KB Output is correct
22 Correct 28 ms 24116 KB Output is correct
23 Correct 28 ms 24056 KB Output is correct
24 Correct 24 ms 24184 KB Output is correct
25 Correct 23 ms 24056 KB Output is correct
26 Correct 27 ms 24056 KB Output is correct
27 Correct 27 ms 24060 KB Output is correct
28 Correct 26 ms 24356 KB Output is correct
29 Correct 25 ms 24444 KB Output is correct
30 Correct 26 ms 24428 KB Output is correct
31 Correct 26 ms 24280 KB Output is correct
32 Correct 26 ms 24440 KB Output is correct
33 Correct 27 ms 24316 KB Output is correct
34 Correct 25 ms 24312 KB Output is correct
35 Correct 234 ms 40728 KB Output is correct
36 Correct 344 ms 52140 KB Output is correct
37 Correct 237 ms 41956 KB Output is correct
38 Correct 374 ms 57652 KB Output is correct
39 Correct 298 ms 44368 KB Output is correct
40 Correct 212 ms 41948 KB Output is correct
41 Correct 482 ms 46456 KB Output is correct
42 Correct 168 ms 40984 KB Output is correct
43 Correct 115 ms 31568 KB Output is correct
44 Correct 344 ms 44148 KB Output is correct
45 Correct 422 ms 47608 KB Output is correct
46 Correct 392 ms 44512 KB Output is correct
47 Correct 403 ms 44436 KB Output is correct
48 Correct 282 ms 42000 KB Output is correct
49 Correct 388 ms 57592 KB Output is correct
50 Correct 426 ms 58092 KB Output is correct
51 Correct 279 ms 48760 KB Output is correct
52 Correct 23 ms 24156 KB Output is correct
53 Correct 514 ms 45432 KB Output is correct
54 Correct 388 ms 44264 KB Output is correct
55 Correct 460 ms 47988 KB Output is correct
56 Correct 432 ms 44896 KB Output is correct
57 Correct 379 ms 54520 KB Output is correct
58 Incorrect 331 ms 47612 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 52548 KB Output is correct
2 Correct 289 ms 43684 KB Output is correct
3 Correct 246 ms 40144 KB Output is correct
4 Correct 335 ms 49272 KB Output is correct
5 Correct 22 ms 24156 KB Output is correct
6 Correct 297 ms 42088 KB Output is correct
7 Correct 133 ms 34992 KB Output is correct
8 Correct 126 ms 31652 KB Output is correct
9 Correct 253 ms 39656 KB Output is correct
10 Correct 265 ms 45800 KB Output is correct
11 Correct 186 ms 39604 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 24056 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 24056 KB Output is correct
18 Correct 23 ms 24056 KB Output is correct
19 Correct 23 ms 24184 KB Output is correct
20 Correct 23 ms 24056 KB Output is correct
21 Correct 23 ms 24040 KB Output is correct
22 Correct 28 ms 24116 KB Output is correct
23 Correct 28 ms 24056 KB Output is correct
24 Correct 24 ms 24184 KB Output is correct
25 Correct 23 ms 24056 KB Output is correct
26 Correct 27 ms 24056 KB Output is correct
27 Correct 27 ms 24060 KB Output is correct
28 Correct 26 ms 24356 KB Output is correct
29 Correct 25 ms 24444 KB Output is correct
30 Correct 26 ms 24428 KB Output is correct
31 Correct 26 ms 24280 KB Output is correct
32 Correct 26 ms 24440 KB Output is correct
33 Correct 27 ms 24316 KB Output is correct
34 Correct 25 ms 24312 KB Output is correct
35 Correct 234 ms 40728 KB Output is correct
36 Correct 344 ms 52140 KB Output is correct
37 Correct 237 ms 41956 KB Output is correct
38 Correct 374 ms 57652 KB Output is correct
39 Correct 298 ms 44368 KB Output is correct
40 Correct 212 ms 41948 KB Output is correct
41 Correct 482 ms 46456 KB Output is correct
42 Correct 168 ms 40984 KB Output is correct
43 Correct 115 ms 31568 KB Output is correct
44 Correct 344 ms 44148 KB Output is correct
45 Correct 422 ms 47608 KB Output is correct
46 Correct 392 ms 44512 KB Output is correct
47 Correct 403 ms 44436 KB Output is correct
48 Correct 282 ms 42000 KB Output is correct
49 Correct 388 ms 57592 KB Output is correct
50 Correct 426 ms 58092 KB Output is correct
51 Correct 279 ms 48760 KB Output is correct
52 Correct 23 ms 24156 KB Output is correct
53 Correct 514 ms 45432 KB Output is correct
54 Correct 388 ms 44264 KB Output is correct
55 Correct 460 ms 47988 KB Output is correct
56 Correct 432 ms 44896 KB Output is correct
57 Correct 1334 ms 90284 KB Output is correct
58 Correct 2009 ms 166568 KB Output is correct
59 Correct 2274 ms 166204 KB Output is correct
60 Correct 1476 ms 119164 KB Output is correct
61 Correct 2954 ms 109228 KB Output is correct
62 Correct 2096 ms 102620 KB Output is correct
63 Correct 2569 ms 118216 KB Output is correct
64 Correct 2612 ms 113148 KB Output is correct
65 Correct 379 ms 54520 KB Output is correct
66 Incorrect 331 ms 47612 KB Output isn't correct
67 Halted 0 ms 0 KB -