Submission #77125

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
77125	2018-09-22T13:51:32 Z	Vardanyan	Art Exhibition (JOI18_art)	C++14	100 / 100	299 ms	212960 KB

#include <bits/stdc++.h>
using namespace std;
const int N = 500*1000+7;
pair<long long,long long> a[N];
long long pref[N];
int main(){
    int n;
    scanf("%d",&n);
    for(int i = 1;i<=n;i++){
            scanf("%lld%lld",&a[i].first,&a[i].second);
    }
    sort(a+1,a+1+n);
    long long ans = 0;
    long long mxdif = -1000000000000005;
    long long s = 0;
    for(int i = 1;i<=n;i++){
        pref[i] = pref[i-1]+a[i].second;
        s+=a[i].second;
        long long u = s-(a[i].first-a[1].first);
        ans = max(ans,u);
        mxdif = max(mxdif,(a[i].first-a[1].first)-pref[i-1]);
        u+=mxdif;
        ans = max(ans,u);
        //cout<<mxdif<<endl;
    }
    printf("%lld\n",ans);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
art.cpp:10:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%lld%lld",&a[i].first,&a[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	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	552 KB	Output is correct
5	Correct	2 ms	552 KB	Output is correct
6	Correct	2 ms	552 KB	Output is correct
7	Correct	2 ms	552 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 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	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	552 KB	Output is correct
5	Correct	2 ms	552 KB	Output is correct
6	Correct	2 ms	552 KB	Output is correct
7	Correct	2 ms	552 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	612 KB	Output is correct
14	Correct	3 ms	612 KB	Output is correct
15	Correct	2 ms	620 KB	Output is correct
16	Correct	2 ms	632 KB	Output is correct
17	Correct	2 ms	792 KB	Output is correct
18	Correct	2 ms	828 KB	Output is correct
19	Correct	2 ms	828 KB	Output is correct
20	Correct	2 ms	828 KB	Output is correct
21	Correct	2 ms	828 KB	Output is correct
22	Correct	2 ms	828 KB	Output is correct
23	Correct	2 ms	828 KB	Output is correct
24	Correct	2 ms	828 KB	Output is correct
25	Correct	2 ms	828 KB	Output is correct
26	Correct	2 ms	828 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	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	552 KB	Output is correct
5	Correct	2 ms	552 KB	Output is correct
6	Correct	2 ms	552 KB	Output is correct
7	Correct	2 ms	552 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	612 KB	Output is correct
14	Correct	3 ms	612 KB	Output is correct
15	Correct	2 ms	620 KB	Output is correct
16	Correct	2 ms	632 KB	Output is correct
17	Correct	2 ms	792 KB	Output is correct
18	Correct	2 ms	828 KB	Output is correct
19	Correct	2 ms	828 KB	Output is correct
20	Correct	2 ms	828 KB	Output is correct
21	Correct	2 ms	828 KB	Output is correct
22	Correct	2 ms	828 KB	Output is correct
23	Correct	2 ms	828 KB	Output is correct
24	Correct	2 ms	828 KB	Output is correct
25	Correct	2 ms	828 KB	Output is correct
26	Correct	2 ms	828 KB	Output is correct
27	Correct	5 ms	920 KB	Output is correct
28	Correct	6 ms	1048 KB	Output is correct
29	Correct	4 ms	1056 KB	Output is correct
30	Correct	4 ms	1056 KB	Output is correct
31	Correct	4 ms	1056 KB	Output is correct
32	Correct	4 ms	1056 KB	Output is correct
33	Correct	4 ms	1056 KB	Output is correct
34	Correct	5 ms	1056 KB	Output is correct
35	Correct	5 ms	1056 KB	Output is correct
36	Correct	4 ms	1056 KB	Output is correct
37	Correct	4 ms	1056 KB	Output is correct
38	Correct	4 ms	1056 KB	Output is correct
39	Correct	5 ms	1056 KB	Output is correct
40	Correct	4 ms	1056 KB	Output is correct
41	Correct	4 ms	1056 KB	Output is correct
42	Correct	4 ms	1056 KB	Output is correct
43	Correct	4 ms	1056 KB	Output is correct
44	Correct	4 ms	1056 KB	Output is correct
45	Correct	5 ms	1056 KB	Output is correct
46	Correct	5 ms	1056 KB	Output is correct
47	Correct	4 ms	1056 KB	Output is correct
48	Correct	4 ms	1148 KB	Output is correct
49	Correct	5 ms	1260 KB	Output is correct
50	Correct	5 ms	1260 KB	Output is correct
51	Correct	4 ms	1260 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	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	552 KB	Output is correct
5	Correct	2 ms	552 KB	Output is correct
6	Correct	2 ms	552 KB	Output is correct
7	Correct	2 ms	552 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	612 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	612 KB	Output is correct
13	Correct	2 ms	612 KB	Output is correct
14	Correct	3 ms	612 KB	Output is correct
15	Correct	2 ms	620 KB	Output is correct
16	Correct	2 ms	632 KB	Output is correct
17	Correct	2 ms	792 KB	Output is correct
18	Correct	2 ms	828 KB	Output is correct
19	Correct	2 ms	828 KB	Output is correct
20	Correct	2 ms	828 KB	Output is correct
21	Correct	2 ms	828 KB	Output is correct
22	Correct	2 ms	828 KB	Output is correct
23	Correct	2 ms	828 KB	Output is correct
24	Correct	2 ms	828 KB	Output is correct
25	Correct	2 ms	828 KB	Output is correct
26	Correct	2 ms	828 KB	Output is correct
27	Correct	5 ms	920 KB	Output is correct
28	Correct	6 ms	1048 KB	Output is correct
29	Correct	4 ms	1056 KB	Output is correct
30	Correct	4 ms	1056 KB	Output is correct
31	Correct	4 ms	1056 KB	Output is correct
32	Correct	4 ms	1056 KB	Output is correct
33	Correct	4 ms	1056 KB	Output is correct
34	Correct	5 ms	1056 KB	Output is correct
35	Correct	5 ms	1056 KB	Output is correct
36	Correct	4 ms	1056 KB	Output is correct
37	Correct	4 ms	1056 KB	Output is correct
38	Correct	4 ms	1056 KB	Output is correct
39	Correct	5 ms	1056 KB	Output is correct
40	Correct	4 ms	1056 KB	Output is correct
41	Correct	4 ms	1056 KB	Output is correct
42	Correct	4 ms	1056 KB	Output is correct
43	Correct	4 ms	1056 KB	Output is correct
44	Correct	4 ms	1056 KB	Output is correct
45	Correct	5 ms	1056 KB	Output is correct
46	Correct	5 ms	1056 KB	Output is correct
47	Correct	4 ms	1056 KB	Output is correct
48	Correct	4 ms	1148 KB	Output is correct
49	Correct	5 ms	1260 KB	Output is correct
50	Correct	5 ms	1260 KB	Output is correct
51	Correct	4 ms	1260 KB	Output is correct
52	Correct	270 ms	12924 KB	Output is correct
53	Correct	265 ms	25536 KB	Output is correct
54	Correct	265 ms	38228 KB	Output is correct
55	Correct	299 ms	51100 KB	Output is correct
56	Correct	275 ms	63644 KB	Output is correct
57	Correct	295 ms	76320 KB	Output is correct
58	Correct	283 ms	89144 KB	Output is correct
59	Correct	266 ms	101784 KB	Output is correct
60	Correct	283 ms	114332 KB	Output is correct
61	Correct	265 ms	127008 KB	Output is correct
62	Correct	268 ms	139616 KB	Output is correct
63	Correct	278 ms	152332 KB	Output is correct
64	Correct	264 ms	165036 KB	Output is correct
65	Correct	285 ms	176580 KB	Output is correct
66	Correct	267 ms	189024 KB	Output is correct
67	Correct	267 ms	200284 KB	Output is correct
68	Correct	266 ms	212960 KB	Output is correct

Submission #77125

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