Submission #708402

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
708402	2023-03-11T17:10:27 Z	starplat	Art Exhibition (JOI18_art)	C++14	100 / 100	596 ms	32972 KB

#include <bits/stdc++.h>
#define int long long
#define mid (x+y)/2
using namespace std;
int n,ans,par[500005];
pair<int,int> a[500005];
int t[500005<<2];
void build(int id,int x,int y)
{
	if (x==y) t[id]=a[x].first-par[x-1];
	else {
		build(id*2,x,mid);
		build(id*2+1,mid+1,y);
		t[id]=max(t[id*2],t[id*2+1]);
	}
}
int query(int id,int x,int y,int l,int r)
{
	if (x>r || y<l) return 0;
	if (l<=x && y<=r) return t[id];
	return max(query(id*2,x,mid,l,r),query(id*2+1,mid+1,y,l,r));
}
signed main()
{
	cin>>n;
	for (int i=1;i<=n;i++) cin>>a[i].first>>a[i].second;
	sort(a+1,a+1+n);
	for (int i=1;i<=n;i++) par[i]=par[i-1]+a[i].second;
	build(1,1,n);
	for (int i=1;i<=n;i++){
		ans=max(ans,par[i]-a[i].first+query(1,1,n,1,i));
	}
	cout<<ans<<'\n';
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	292 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	284 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	292 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	284 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	308 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	316 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	308 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	292 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	284 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	308 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	316 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	308 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	6 ms	692 KB	Output is correct
28	Correct	7 ms	576 KB	Output is correct
29	Correct	6 ms	596 KB	Output is correct
30	Correct	6 ms	684 KB	Output is correct
31	Correct	7 ms	596 KB	Output is correct
32	Correct	7 ms	628 KB	Output is correct
33	Correct	6 ms	596 KB	Output is correct
34	Correct	6 ms	700 KB	Output is correct
35	Correct	7 ms	580 KB	Output is correct
36	Correct	6 ms	684 KB	Output is correct
37	Correct	7 ms	704 KB	Output is correct
38	Correct	6 ms	596 KB	Output is correct
39	Correct	6 ms	596 KB	Output is correct
40	Correct	6 ms	576 KB	Output is correct
41	Correct	5 ms	596 KB	Output is correct
42	Correct	6 ms	700 KB	Output is correct
43	Correct	6 ms	596 KB	Output is correct
44	Correct	6 ms	572 KB	Output is correct
45	Correct	6 ms	688 KB	Output is correct
46	Correct	5 ms	640 KB	Output is correct
47	Correct	6 ms	684 KB	Output is correct
48	Correct	6 ms	576 KB	Output is correct
49	Correct	5 ms	596 KB	Output is correct
50	Correct	5 ms	632 KB	Output is correct
51	Correct	6 ms	636 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	292 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	284 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	308 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	316 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	308 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	6 ms	692 KB	Output is correct
28	Correct	7 ms	576 KB	Output is correct
29	Correct	6 ms	596 KB	Output is correct
30	Correct	6 ms	684 KB	Output is correct
31	Correct	7 ms	596 KB	Output is correct
32	Correct	7 ms	628 KB	Output is correct
33	Correct	6 ms	596 KB	Output is correct
34	Correct	6 ms	700 KB	Output is correct
35	Correct	7 ms	580 KB	Output is correct
36	Correct	6 ms	684 KB	Output is correct
37	Correct	7 ms	704 KB	Output is correct
38	Correct	6 ms	596 KB	Output is correct
39	Correct	6 ms	596 KB	Output is correct
40	Correct	6 ms	576 KB	Output is correct
41	Correct	5 ms	596 KB	Output is correct
42	Correct	6 ms	700 KB	Output is correct
43	Correct	6 ms	596 KB	Output is correct
44	Correct	6 ms	572 KB	Output is correct
45	Correct	6 ms	688 KB	Output is correct
46	Correct	5 ms	640 KB	Output is correct
47	Correct	6 ms	684 KB	Output is correct
48	Correct	6 ms	576 KB	Output is correct
49	Correct	5 ms	596 KB	Output is correct
50	Correct	5 ms	632 KB	Output is correct
51	Correct	6 ms	636 KB	Output is correct
52	Correct	580 ms	32824 KB	Output is correct
53	Correct	562 ms	32768 KB	Output is correct
54	Correct	596 ms	32888 KB	Output is correct
55	Correct	548 ms	32800 KB	Output is correct
56	Correct	554 ms	32844 KB	Output is correct
57	Correct	571 ms	32812 KB	Output is correct
58	Correct	543 ms	32940 KB	Output is correct
59	Correct	551 ms	32796 KB	Output is correct
60	Correct	581 ms	32856 KB	Output is correct
61	Correct	548 ms	32636 KB	Output is correct
62	Correct	562 ms	32840 KB	Output is correct
63	Correct	541 ms	32972 KB	Output is correct
64	Correct	548 ms	32844 KB	Output is correct
65	Correct	550 ms	32788 KB	Output is correct
66	Correct	544 ms	32880 KB	Output is correct
67	Correct	538 ms	32952 KB	Output is correct
68	Correct	560 ms	32924 KB	Output is correct

Submission #708402

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