Submission #136265

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
136265	2019-07-25T05:12:33 Z	KLPP	Art Exhibition (JOI18_art)	C++14	100 / 100	278 ms	24684 KB

#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)

int main(){
  int n;
  scanf("%d",&n);
  pii arr[n];
  rep(i,0,n){
    scanf("%lld %lld",&arr[i].first,&arr[i].second);
  }
  sort(arr,arr+n);
  lld DP[n];
  DP[0]=arr[0].second;
  rep(i,1,n){
    DP[i]=arr[i].second;
    DP[i]=max(DP[i],DP[i-1]+arr[i].second-(arr[i].first-arr[i-1].first));
  }
  lld ans=0;
  rep(i,0,n)ans=max(ans,DP[i]);
  printf("%lld\n",ans);
  return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ~~~~~^~~~~~~~~
art.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld",&arr[i].first,&arr[i].second);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	252 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	404 KB	Output is correct
13	Correct	2 ms	300 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	3 ms	256 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	3 ms	360 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	4 ms	504 KB	Output is correct
28	Correct	4 ms	504 KB	Output is correct
29	Correct	4 ms	632 KB	Output is correct
30	Correct	5 ms	536 KB	Output is correct
31	Correct	4 ms	504 KB	Output is correct
32	Correct	5 ms	504 KB	Output is correct
33	Correct	4 ms	504 KB	Output is correct
34	Correct	5 ms	504 KB	Output is correct
35	Correct	5 ms	632 KB	Output is correct
36	Correct	5 ms	604 KB	Output is correct
37	Correct	5 ms	632 KB	Output is correct
38	Correct	5 ms	512 KB	Output is correct
39	Correct	4 ms	556 KB	Output is correct
40	Correct	4 ms	632 KB	Output is correct
41	Correct	5 ms	632 KB	Output is correct
42	Correct	4 ms	576 KB	Output is correct
43	Correct	4 ms	504 KB	Output is correct
44	Correct	4 ms	504 KB	Output is correct
45	Correct	4 ms	632 KB	Output is correct
46	Correct	5 ms	504 KB	Output is correct
47	Correct	5 ms	504 KB	Output is correct
48	Correct	4 ms	504 KB	Output is correct
49	Correct	5 ms	632 KB	Output is correct
50	Correct	4 ms	632 KB	Output is correct
51	Correct	5 ms	604 KB	Output is correct
52	Correct	278 ms	24684 KB	Output is correct
53	Correct	273 ms	24672 KB	Output is correct
54	Correct	268 ms	24664 KB	Output is correct
55	Correct	272 ms	24676 KB	Output is correct
56	Correct	272 ms	24668 KB	Output is correct
57	Correct	270 ms	24680 KB	Output is correct
58	Correct	271 ms	24680 KB	Output is correct
59	Correct	269 ms	24680 KB	Output is correct
60	Correct	273 ms	24672 KB	Output is correct
61	Correct	274 ms	24544 KB	Output is correct
62	Correct	270 ms	24672 KB	Output is correct
63	Correct	273 ms	24668 KB	Output is correct
64	Correct	270 ms	24676 KB	Output is correct
65	Correct	273 ms	24668 KB	Output is correct
66	Correct	269 ms	24668 KB	Output is correct
67	Correct	268 ms	24672 KB	Output is correct
68	Correct	263 ms	24668 KB	Output is correct

Submission #136265

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