Submission #1062428

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1062428	2024-08-17T06:47:52 Z	ducksaysquack	Art Exhibition (JOI18_art)	C++	100 / 100	395 ms	24916 KB

#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
signed main() {
	int n; cin >> n;
	vector<pair<int,int>> v(n+1); for(int i=0;i<n;i++) cin >> v[i].f >> v[i].s;
	sort(begin(v),end(v));
	for(int i=0;i<n;i++) v[i+1].s += v[i].s;
	vector<int> w(n); w[0] = v[1].f-v[0].s;
	for(int i=1;i<n;i++) w[i] = max(w[i-1],v[i+1].f-v[i].s);
	int ans = 0; for(int i=1;i<=n;i++) ans = max(ans, w[i-1]+v[i].s-v[i].f);
	cout << ans;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 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	348 KB	Output is correct
25	Correct	0 ms	432 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	1 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 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	348 KB	Output is correct
25	Correct	0 ms	432 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	4 ms	604 KB	Output is correct
28	Correct	4 ms	604 KB	Output is correct
29	Correct	4 ms	604 KB	Output is correct
30	Correct	3 ms	604 KB	Output is correct
31	Correct	3 ms	444 KB	Output is correct
32	Correct	4 ms	444 KB	Output is correct
33	Correct	4 ms	604 KB	Output is correct
34	Correct	5 ms	604 KB	Output is correct
35	Correct	5 ms	636 KB	Output is correct
36	Correct	4 ms	604 KB	Output is correct
37	Correct	4 ms	604 KB	Output is correct
38	Correct	3 ms	628 KB	Output is correct
39	Correct	4 ms	640 KB	Output is correct
40	Correct	3 ms	604 KB	Output is correct
41	Correct	4 ms	640 KB	Output is correct
42	Correct	3 ms	604 KB	Output is correct
43	Correct	4 ms	604 KB	Output is correct
44	Correct	4 ms	856 KB	Output is correct
45	Correct	3 ms	604 KB	Output is correct
46	Correct	4 ms	604 KB	Output is correct
47	Correct	4 ms	604 KB	Output is correct
48	Correct	4 ms	604 KB	Output is correct
49	Correct	4 ms	620 KB	Output is correct
50	Correct	4 ms	624 KB	Output is correct
51	Correct	5 ms	624 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 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	348 KB	Output is correct
25	Correct	0 ms	432 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	4 ms	604 KB	Output is correct
28	Correct	4 ms	604 KB	Output is correct
29	Correct	4 ms	604 KB	Output is correct
30	Correct	3 ms	604 KB	Output is correct
31	Correct	3 ms	444 KB	Output is correct
32	Correct	4 ms	444 KB	Output is correct
33	Correct	4 ms	604 KB	Output is correct
34	Correct	5 ms	604 KB	Output is correct
35	Correct	5 ms	636 KB	Output is correct
36	Correct	4 ms	604 KB	Output is correct
37	Correct	4 ms	604 KB	Output is correct
38	Correct	3 ms	628 KB	Output is correct
39	Correct	4 ms	640 KB	Output is correct
40	Correct	3 ms	604 KB	Output is correct
41	Correct	4 ms	640 KB	Output is correct
42	Correct	3 ms	604 KB	Output is correct
43	Correct	4 ms	604 KB	Output is correct
44	Correct	4 ms	856 KB	Output is correct
45	Correct	3 ms	604 KB	Output is correct
46	Correct	4 ms	604 KB	Output is correct
47	Correct	4 ms	604 KB	Output is correct
48	Correct	4 ms	604 KB	Output is correct
49	Correct	4 ms	620 KB	Output is correct
50	Correct	4 ms	624 KB	Output is correct
51	Correct	5 ms	624 KB	Output is correct
52	Correct	363 ms	24752 KB	Output is correct
53	Correct	347 ms	24916 KB	Output is correct
54	Correct	347 ms	24628 KB	Output is correct
55	Correct	334 ms	24632 KB	Output is correct
56	Correct	395 ms	24636 KB	Output is correct
57	Correct	349 ms	24772 KB	Output is correct
58	Correct	338 ms	24760 KB	Output is correct
59	Correct	338 ms	24660 KB	Output is correct
60	Correct	333 ms	24660 KB	Output is correct
61	Correct	346 ms	24628 KB	Output is correct
62	Correct	338 ms	24660 KB	Output is correct
63	Correct	338 ms	24768 KB	Output is correct
64	Correct	344 ms	24756 KB	Output is correct
65	Correct	339 ms	24756 KB	Output is correct
66	Correct	333 ms	24768 KB	Output is correct
67	Correct	352 ms	24660 KB	Output is correct
68	Correct	336 ms	24760 KB	Output is correct

Submission #1062428

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