답안 #211101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
211101	2020-03-19T08:25:38 Z	ld_minh4354	Art Exhibition (JOI18_art)	C++14	100 / 100	244 ms	32760 KB

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second

int n,i,dp[500010],d[500010],v[500010],ans;
pair<int,int> x[500010];

signed main()
{
    ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n;
	for (i=1;i<n+1;i++) cin>>x[i].fi>>x[i].se;
	sort(x+1,x+n+1);
	for (i=1;i<n+1;i++) d[i]=x[i].fi,v[i]=x[i].se;
	for (i=1;i<n;i++) d[i]=d[i+1]-d[i];d[n]=0;
	dp[1]=v[1]-d[1];
	for (i=2;i<n+1;i++) dp[i]=max(v[i]-d[i],v[i]-d[i]+dp[i-1]);
	for (i=1;i<n+1;i++) dp[i]=dp[i]+d[i];
	ans=0;
	for (i=1;i<n+1;i++) ans=max(ans,dp[i]);
	cout<<ans;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:21:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for (i=1;i<n;i++) d[i]=d[i+1]-d[i];d[n]=0;
  ^~~
art.cpp:21:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for (i=1;i<n;i++) d[i]=d[i+1]-d[i];d[n]=0;
                                     ^

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	380 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	380 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	512 KB	Output is correct
28	Correct	7 ms	512 KB	Output is correct
29	Correct	6 ms	640 KB	Output is correct
30	Correct	6 ms	512 KB	Output is correct
31	Correct	7 ms	512 KB	Output is correct
32	Correct	7 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	7 ms	640 KB	Output is correct
35	Correct	7 ms	640 KB	Output is correct
36	Correct	7 ms	512 KB	Output is correct
37	Correct	6 ms	640 KB	Output is correct
38	Correct	7 ms	512 KB	Output is correct
39	Correct	7 ms	512 KB	Output is correct
40	Correct	7 ms	640 KB	Output is correct
41	Correct	7 ms	640 KB	Output is correct
42	Correct	6 ms	512 KB	Output is correct
43	Correct	6 ms	640 KB	Output is correct
44	Correct	8 ms	512 KB	Output is correct
45	Correct	7 ms	512 KB	Output is correct
46	Correct	7 ms	640 KB	Output is correct
47	Correct	6 ms	512 KB	Output is correct
48	Correct	6 ms	512 KB	Output is correct
49	Correct	6 ms	512 KB	Output is correct
50	Correct	6 ms	512 KB	Output is correct
51	Correct	7 ms	512 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	380 KB	Output is correct
21	Correct	4 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	512 KB	Output is correct
28	Correct	7 ms	512 KB	Output is correct
29	Correct	6 ms	640 KB	Output is correct
30	Correct	6 ms	512 KB	Output is correct
31	Correct	7 ms	512 KB	Output is correct
32	Correct	7 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	7 ms	640 KB	Output is correct
35	Correct	7 ms	640 KB	Output is correct
36	Correct	7 ms	512 KB	Output is correct
37	Correct	6 ms	640 KB	Output is correct
38	Correct	7 ms	512 KB	Output is correct
39	Correct	7 ms	512 KB	Output is correct
40	Correct	7 ms	640 KB	Output is correct
41	Correct	7 ms	640 KB	Output is correct
42	Correct	6 ms	512 KB	Output is correct
43	Correct	6 ms	640 KB	Output is correct
44	Correct	8 ms	512 KB	Output is correct
45	Correct	7 ms	512 KB	Output is correct
46	Correct	7 ms	640 KB	Output is correct
47	Correct	6 ms	512 KB	Output is correct
48	Correct	6 ms	512 KB	Output is correct
49	Correct	6 ms	512 KB	Output is correct
50	Correct	6 ms	512 KB	Output is correct
51	Correct	7 ms	512 KB	Output is correct
52	Correct	231 ms	26100 KB	Output is correct
53	Correct	236 ms	32632 KB	Output is correct
54	Correct	238 ms	32760 KB	Output is correct
55	Correct	238 ms	32632 KB	Output is correct
56	Correct	233 ms	32632 KB	Output is correct
57	Correct	241 ms	32632 KB	Output is correct
58	Correct	228 ms	32504 KB	Output is correct
59	Correct	232 ms	32504 KB	Output is correct
60	Correct	234 ms	32504 KB	Output is correct
61	Correct	231 ms	32376 KB	Output is correct
62	Correct	230 ms	32620 KB	Output is correct
63	Correct	227 ms	32632 KB	Output is correct
64	Correct	244 ms	32632 KB	Output is correct
65	Correct	229 ms	32504 KB	Output is correct
66	Correct	231 ms	32632 KB	Output is correct
67	Correct	238 ms	32632 KB	Output is correct
68	Correct	224 ms	32504 KB	Output is correct

답안 #211101

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