Submission #211098

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
211098	2020-03-19T08:24:03 Z	ld_minh4354	Art Exhibition (JOI18_art)	C++14	50 / 100	116 ms	15036 KB

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

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

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

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

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 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	5 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	7 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 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	5 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	7 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	384 KB	Output is correct
21	Correct	6 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	6 ms	384 KB	Output is correct
26	Correct	5 ms	304 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 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	5 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	7 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	384 KB	Output is correct
21	Correct	6 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	6 ms	384 KB	Output is correct
26	Correct	5 ms	304 KB	Output is correct
27	Correct	7 ms	768 KB	Output is correct
28	Correct	8 ms	640 KB	Output is correct
29	Correct	7 ms	640 KB	Output is correct
30	Correct	8 ms	640 KB	Output is correct
31	Correct	8 ms	640 KB	Output is correct
32	Correct	6 ms	640 KB	Output is correct
33	Correct	7 ms	744 KB	Output is correct
34	Correct	8 ms	768 KB	Output is correct
35	Correct	7 ms	768 KB	Output is correct
36	Correct	7 ms	768 KB	Output is correct
37	Correct	7 ms	640 KB	Output is correct
38	Correct	7 ms	768 KB	Output is correct
39	Correct	8 ms	640 KB	Output is correct
40	Correct	7 ms	640 KB	Output is correct
41	Correct	8 ms	692 KB	Output is correct
42	Correct	8 ms	640 KB	Output is correct
43	Correct	8 ms	640 KB	Output is correct
44	Correct	7 ms	640 KB	Output is correct
45	Correct	8 ms	636 KB	Output is correct
46	Correct	9 ms	664 KB	Output is correct
47	Correct	8 ms	640 KB	Output is correct
48	Correct	7 ms	640 KB	Output is correct
49	Correct	8 ms	640 KB	Output is correct
50	Correct	7 ms	640 KB	Output is correct
51	Correct	8 ms	640 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 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	5 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	7 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	384 KB	Output is correct
21	Correct	6 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	6 ms	384 KB	Output is correct
26	Correct	5 ms	304 KB	Output is correct
27	Correct	7 ms	768 KB	Output is correct
28	Correct	8 ms	640 KB	Output is correct
29	Correct	7 ms	640 KB	Output is correct
30	Correct	8 ms	640 KB	Output is correct
31	Correct	8 ms	640 KB	Output is correct
32	Correct	6 ms	640 KB	Output is correct
33	Correct	7 ms	744 KB	Output is correct
34	Correct	8 ms	768 KB	Output is correct
35	Correct	7 ms	768 KB	Output is correct
36	Correct	7 ms	768 KB	Output is correct
37	Correct	7 ms	640 KB	Output is correct
38	Correct	7 ms	768 KB	Output is correct
39	Correct	8 ms	640 KB	Output is correct
40	Correct	7 ms	640 KB	Output is correct
41	Correct	8 ms	692 KB	Output is correct
42	Correct	8 ms	640 KB	Output is correct
43	Correct	8 ms	640 KB	Output is correct
44	Correct	7 ms	640 KB	Output is correct
45	Correct	8 ms	636 KB	Output is correct
46	Correct	9 ms	664 KB	Output is correct
47	Correct	8 ms	640 KB	Output is correct
48	Correct	7 ms	640 KB	Output is correct
49	Correct	8 ms	640 KB	Output is correct
50	Correct	7 ms	640 KB	Output is correct
51	Correct	8 ms	640 KB	Output is correct
52	Runtime error	116 ms	15036 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-

Submission #211098

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0