Submission #334204

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
334204	2020-12-08T15:53:03 Z	shahriarkhan	Art Exhibition (JOI18_art)	C++14	100 / 100	261 ms	25064 KB

art

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

const long long INF = 1e18 ;

int main()
{
    int n ;
    scanf("%d",&n) ;
    vector<pair<long long , long long> > v ;
    v.push_back({0,0}) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        long long a , b ;
        scanf("%lld%lld",&a,&b) ;
        v.push_back({a,b}) ;
    }
    sort(v.begin(),v.end()) ;
    long long pref[n+1] = {0} , ans = -INF , mn = v[1].first ;
    for(int i = 1 ; i <= n ; ++i)
    {
        pref[i] = pref[i-1] + v[i].second ;
    }
    for(int i = 1 ; i <= n ; ++i)
    {
        ans = max(ans,pref[i] - v[i].first + mn) ;
        mn = max(mn,-pref[i] + v[i+1].first) ;
    }
    printf("%lld\n",ans) ;
    return 0 ;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     scanf("%d",&n) ;
      |     ~~~~~^~~~~~~~~
art.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |         scanf("%lld%lld",&a,&b) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	3 ms	620 KB	Output is correct
28	Correct	3 ms	620 KB	Output is correct
29	Correct	3 ms	620 KB	Output is correct
30	Correct	3 ms	620 KB	Output is correct
31	Correct	3 ms	620 KB	Output is correct
32	Correct	3 ms	620 KB	Output is correct
33	Correct	3 ms	620 KB	Output is correct
34	Correct	3 ms	620 KB	Output is correct
35	Correct	3 ms	620 KB	Output is correct
36	Correct	3 ms	620 KB	Output is correct
37	Correct	4 ms	620 KB	Output is correct
38	Correct	3 ms	620 KB	Output is correct
39	Correct	3 ms	620 KB	Output is correct
40	Correct	3 ms	620 KB	Output is correct
41	Correct	3 ms	620 KB	Output is correct
42	Correct	3 ms	620 KB	Output is correct
43	Correct	3 ms	620 KB	Output is correct
44	Correct	3 ms	620 KB	Output is correct
45	Correct	4 ms	620 KB	Output is correct
46	Correct	3 ms	620 KB	Output is correct
47	Correct	3 ms	620 KB	Output is correct
48	Correct	3 ms	620 KB	Output is correct
49	Correct	3 ms	620 KB	Output is correct
50	Correct	3 ms	620 KB	Output is correct
51	Correct	3 ms	620 KB	Output is correct
52	Correct	226 ms	24776 KB	Output is correct
53	Correct	225 ms	24776 KB	Output is correct
54	Correct	220 ms	24904 KB	Output is correct
55	Correct	224 ms	25064 KB	Output is correct
56	Correct	219 ms	24904 KB	Output is correct
57	Correct	221 ms	24776 KB	Output is correct
58	Correct	230 ms	25036 KB	Output is correct
59	Correct	218 ms	24904 KB	Output is correct
60	Correct	218 ms	24904 KB	Output is correct
61	Correct	225 ms	24904 KB	Output is correct
62	Correct	261 ms	24908 KB	Output is correct
63	Correct	219 ms	24904 KB	Output is correct
64	Correct	223 ms	24904 KB	Output is correct
65	Correct	221 ms	24904 KB	Output is correct
66	Correct	222 ms	25040 KB	Output is correct
67	Correct	222 ms	24928 KB	Output is correct
68	Correct	222 ms	24904 KB	Output is correct