Submission #121956

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
121956	2019-06-27T09:26:28 Z	DodgeBallMan	Art Exhibition (JOI18_art)	C++14	100 / 100	296 ms	21076 KB

#include <bits/stdc++.h>
#define pll pair<long long, long long>
#define x first
#define y second

using namespace std;

vector<pll> v;
int n;
long long ans, pref, mx;

int main()
{
    scanf("%d",&n);
    for( int i = 1 ; i <= n ; i++ ) {
        long long a, b;
        scanf("%lld %lld",&a,&b);
        v.emplace_back( pll( a, b ) );
    }
    sort( v.begin(), v.end() );
    for( int i = 0 ; i < n ; i++ ) {
        long long a, b; 
        tie( a, b ) = v[i];
        mx = max( mx, a - pref );
        pref += b;
        ans = max( ans, pref - a + mx );
    }
    printf("%lld",ans);
    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	404 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	5 ms	640 KB	Output is correct
28	Correct	4 ms	632 KB	Output is correct
29	Correct	5 ms	640 KB	Output is correct
30	Correct	4 ms	640 KB	Output is correct
31	Correct	4 ms	640 KB	Output is correct
32	Correct	4 ms	640 KB	Output is correct
33	Correct	4 ms	640 KB	Output is correct
34	Correct	4 ms	640 KB	Output is correct
35	Correct	4 ms	640 KB	Output is correct
36	Correct	4 ms	640 KB	Output is correct
37	Correct	4 ms	640 KB	Output is correct
38	Correct	5 ms	640 KB	Output is correct
39	Correct	4 ms	640 KB	Output is correct
40	Correct	4 ms	676 KB	Output is correct
41	Correct	5 ms	640 KB	Output is correct
42	Correct	4 ms	640 KB	Output is correct
43	Correct	5 ms	640 KB	Output is correct
44	Correct	4 ms	640 KB	Output is correct
45	Correct	4 ms	640 KB	Output is correct
46	Correct	4 ms	740 KB	Output is correct
47	Correct	4 ms	640 KB	Output is correct
48	Correct	4 ms	640 KB	Output is correct
49	Correct	4 ms	640 KB	Output is correct
50	Correct	4 ms	640 KB	Output is correct
51	Correct	4 ms	612 KB	Output is correct
52	Correct	236 ms	20956 KB	Output is correct
53	Correct	228 ms	20948 KB	Output is correct
54	Correct	232 ms	21072 KB	Output is correct
55	Correct	239 ms	20944 KB	Output is correct
56	Correct	241 ms	20944 KB	Output is correct
57	Correct	238 ms	21072 KB	Output is correct
58	Correct	296 ms	21040 KB	Output is correct
59	Correct	233 ms	20948 KB	Output is correct
60	Correct	236 ms	21036 KB	Output is correct
61	Correct	240 ms	20912 KB	Output is correct
62	Correct	253 ms	21072 KB	Output is correct
63	Correct	240 ms	20948 KB	Output is correct
64	Correct	239 ms	20816 KB	Output is correct
65	Correct	235 ms	21076 KB	Output is correct
66	Correct	227 ms	20916 KB	Output is correct
67	Correct	236 ms	21076 KB	Output is correct
68	Correct	231 ms	21072 KB	Output is correct

Submission #121956

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