Submission #257401

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
257401	2020-08-04T08:36:26 Z	YJU	Art Exhibition (JOI18_art)	C++14	100 / 100	255 ms	24972 KB

art

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll MOD=1e9+7;
const ll N=5e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<62);
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(a) (ll)a.size()

ll n,x,y,dp[N],ans;
vector<pll> v;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	REP(i,n){
		cin>>x>>y;v.pb(mp(x,y));
	}	
	sort(v.begin(),v.end());
	REP(i,n)v[i].Y-=(v[i+1].X-v[i].X);
	REP(i,n){
		dp[i]=max(v[i].Y,v[i].Y+(i?dp[i-1]:0));
		ans=max(ans,dp[i]+v[i+1].X-v[i].X);
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	0 ms	384 KB	Output is correct
27	Correct	2 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	2 ms	640 KB	Output is correct
30	Correct	2 ms	640 KB	Output is correct
31	Correct	2 ms	640 KB	Output is correct
32	Correct	3 ms	640 KB	Output is correct
33	Correct	2 ms	640 KB	Output is correct
34	Correct	3 ms	640 KB	Output is correct
35	Correct	2 ms	640 KB	Output is correct
36	Correct	3 ms	640 KB	Output is correct
37	Correct	2 ms	640 KB	Output is correct
38	Correct	3 ms	640 KB	Output is correct
39	Correct	2 ms	640 KB	Output is correct
40	Correct	2 ms	640 KB	Output is correct
41	Correct	2 ms	640 KB	Output is correct
42	Correct	2 ms	640 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	2 ms	640 KB	Output is correct
45	Correct	2 ms	640 KB	Output is correct
46	Correct	3 ms	640 KB	Output is correct
47	Correct	3 ms	640 KB	Output is correct
48	Correct	2 ms	640 KB	Output is correct
49	Correct	2 ms	640 KB	Output is correct
50	Correct	3 ms	640 KB	Output is correct
51	Correct	3 ms	640 KB	Output is correct
52	Correct	216 ms	12244 KB	Output is correct
53	Correct	225 ms	24848 KB	Output is correct
54	Correct	216 ms	24788 KB	Output is correct
55	Correct	220 ms	24788 KB	Output is correct
56	Correct	220 ms	24788 KB	Output is correct
57	Correct	222 ms	24788 KB	Output is correct
58	Correct	221 ms	24788 KB	Output is correct
59	Correct	219 ms	24792 KB	Output is correct
60	Correct	221 ms	24912 KB	Output is correct
61	Correct	255 ms	24688 KB	Output is correct
62	Correct	239 ms	24792 KB	Output is correct
63	Correct	224 ms	24876 KB	Output is correct
64	Correct	230 ms	24928 KB	Output is correct
65	Correct	227 ms	24972 KB	Output is correct
66	Correct	226 ms	24952 KB	Output is correct
67	Correct	230 ms	24788 KB	Output is correct
68	Correct	228 ms	24788 KB	Output is correct