Submission #539728

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
539728	2022-03-19T06:49:05 Z	krit3379	Art Exhibition (JOI18_art)	C++17	100 / 100	304 ms	28728 KB

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

long long qs[N],ma[N],ans;
pair<long long,long long> a[N];

int main(){
    int n,i;
    scanf("%d",&n);
    for(i=1;i<=n;i++)scanf("%lld %lld",&a[i].first,&a[i].second);
    sort(a+1,a+n+1);
    a[0].first=a[1].first;
    for(i=1;i<=n;i++)qs[i]=a[i].second+qs[i-1];
    for(i=n,ma[n+1]=-1e18;i>0;i--)ma[i]=max(qs[i]-a[i].first,ma[i+1]);
    for(i=1;i<=n;i++)ans=max(ans,ma[i]-qs[i-1]+a[i].first);
    printf("%lld",ans);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
art.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for(i=1;i<=n;i++)scanf("%lld %lld",&a[i].first,&a[i].second);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	304 KB	Output is correct
11	Correct	0 ms	308 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	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	304 KB	Output is correct
11	Correct	0 ms	308 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	212 KB	Output is correct
15	Correct	1 ms	212 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	212 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	312 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 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	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	304 KB	Output is correct
11	Correct	0 ms	308 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	212 KB	Output is correct
15	Correct	1 ms	212 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	212 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	312 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	4 ms	588 KB	Output is correct
28	Correct	3 ms	596 KB	Output is correct
29	Correct	3 ms	596 KB	Output is correct
30	Correct	3 ms	576 KB	Output is correct
31	Correct	4 ms	556 KB	Output is correct
32	Correct	3 ms	588 KB	Output is correct
33	Correct	3 ms	564 KB	Output is correct
34	Correct	4 ms	596 KB	Output is correct
35	Correct	3 ms	596 KB	Output is correct
36	Correct	5 ms	596 KB	Output is correct
37	Correct	2 ms	596 KB	Output is correct
38	Correct	5 ms	596 KB	Output is correct
39	Correct	3 ms	496 KB	Output is correct
40	Correct	2 ms	572 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct
42	Correct	3 ms	596 KB	Output is correct
43	Correct	3 ms	500 KB	Output is correct
44	Correct	2 ms	576 KB	Output is correct
45	Correct	3 ms	596 KB	Output is correct
46	Correct	2 ms	596 KB	Output is correct
47	Correct	2 ms	552 KB	Output is correct
48	Correct	3 ms	596 KB	Output is correct
49	Correct	4 ms	596 KB	Output is correct
50	Correct	4 ms	556 KB	Output is correct
51	Correct	4 ms	596 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	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	304 KB	Output is correct
11	Correct	0 ms	308 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	212 KB	Output is correct
15	Correct	1 ms	212 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	212 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	312 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	4 ms	588 KB	Output is correct
28	Correct	3 ms	596 KB	Output is correct
29	Correct	3 ms	596 KB	Output is correct
30	Correct	3 ms	576 KB	Output is correct
31	Correct	4 ms	556 KB	Output is correct
32	Correct	3 ms	588 KB	Output is correct
33	Correct	3 ms	564 KB	Output is correct
34	Correct	4 ms	596 KB	Output is correct
35	Correct	3 ms	596 KB	Output is correct
36	Correct	5 ms	596 KB	Output is correct
37	Correct	2 ms	596 KB	Output is correct
38	Correct	5 ms	596 KB	Output is correct
39	Correct	3 ms	496 KB	Output is correct
40	Correct	2 ms	572 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct
42	Correct	3 ms	596 KB	Output is correct
43	Correct	3 ms	500 KB	Output is correct
44	Correct	2 ms	576 KB	Output is correct
45	Correct	3 ms	596 KB	Output is correct
46	Correct	2 ms	596 KB	Output is correct
47	Correct	2 ms	552 KB	Output is correct
48	Correct	3 ms	596 KB	Output is correct
49	Correct	4 ms	596 KB	Output is correct
50	Correct	4 ms	556 KB	Output is correct
51	Correct	4 ms	596 KB	Output is correct
52	Correct	203 ms	28512 KB	Output is correct
53	Correct	205 ms	28588 KB	Output is correct
54	Correct	221 ms	28592 KB	Output is correct
55	Correct	213 ms	28508 KB	Output is correct
56	Correct	201 ms	28588 KB	Output is correct
57	Correct	203 ms	28728 KB	Output is correct
58	Correct	304 ms	28608 KB	Output is correct
59	Correct	237 ms	28588 KB	Output is correct
60	Correct	230 ms	28596 KB	Output is correct
61	Correct	198 ms	28432 KB	Output is correct
62	Correct	197 ms	28552 KB	Output is correct
63	Correct	193 ms	28716 KB	Output is correct
64	Correct	195 ms	28648 KB	Output is correct
65	Correct	203 ms	28588 KB	Output is correct
66	Correct	233 ms	28548 KB	Output is correct
67	Correct	201 ms	28576 KB	Output is correct
68	Correct	193 ms	28492 KB	Output is correct

Submission #539728

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