Submission #844535

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
844535	2023-09-05T13:58:27 Z	Mr_Husanboy	Art Exhibition (JOI18_art)	C++17	100 / 100	157 ms	30828 KB

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define all(a) (a).begin(), (a).end()

template<typename T>
int len(T &a){return a.size();}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	int n; cin >> n;

	vector<ll> a(n), b(n);

	for(int i = 0; i < n; i ++){
		cin >> a[i] >> b[i];
	}

	vector<int> p(n); iota(all(p),0);

	sort(all(p), [&](int i, int j){return a[i] < a[j];});

	vector<ll> val(n);
	ll cur = 0;
	for(int i = 0; i < n; i ++){
		cur += b[p[i]];
		if(i > 0) cur -= a[p[i]] - a[p[i - 1]];
		val[i] = cur;
	}

	vector<ll> mx(n);
	mx[n - 1] = val[n - 1];
	for(int i = n - 2; i >= 0; i --){
		mx[i] = max(val[i], mx[i + 1]);
	}
	
	

	ll ans = 0; cur = 0;

	for(int i = 0; i < n; i ++){
		ans = max(ans, mx[i] - cur);
		cur += b[p[i]];
		if(i < n - 1) cur -= a[p[i + 1]] - a[p[i]];
	}

	cout << ans;
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	464 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	456 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	464 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	456 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	552 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	2 ms	656 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	2 ms	600 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	600 KB	Output is correct
40	Correct	2 ms	604 KB	Output is correct
41	Correct	2 ms	856 KB	Output is correct
42	Correct	2 ms	664 KB	Output is correct
43	Correct	2 ms	724 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	2 ms	724 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	600 KB	Output is correct
50	Correct	2 ms	728 KB	Output is correct
51	Correct	2 ms	600 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	464 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	456 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	552 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	2 ms	656 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	2 ms	600 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	600 KB	Output is correct
40	Correct	2 ms	604 KB	Output is correct
41	Correct	2 ms	856 KB	Output is correct
42	Correct	2 ms	664 KB	Output is correct
43	Correct	2 ms	724 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	2 ms	724 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	600 KB	Output is correct
50	Correct	2 ms	728 KB	Output is correct
51	Correct	2 ms	600 KB	Output is correct
52	Correct	146 ms	30504 KB	Output is correct
53	Correct	146 ms	30532 KB	Output is correct
54	Correct	152 ms	30648 KB	Output is correct
55	Correct	151 ms	30564 KB	Output is correct
56	Correct	145 ms	30544 KB	Output is correct
57	Correct	153 ms	30828 KB	Output is correct
58	Correct	145 ms	30676 KB	Output is correct
59	Correct	150 ms	30704 KB	Output is correct
60	Correct	151 ms	30812 KB	Output is correct
61	Correct	148 ms	30548 KB	Output is correct
62	Correct	146 ms	30560 KB	Output is correct
63	Correct	152 ms	30668 KB	Output is correct
64	Correct	146 ms	30532 KB	Output is correct
65	Correct	147 ms	30548 KB	Output is correct
66	Correct	157 ms	30540 KB	Output is correct
67	Correct	147 ms	30652 KB	Output is correct
68	Correct	147 ms	30540 KB	Output is correct

Submission #844535

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0