Submission #331893

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
331893	2020-11-30T16:12:23 Z	MladenP	Art Exhibition (JOI18_art)	C++17	100 / 100	229 ms	20972 KB

#include<bits/stdc++.h>
#define fi first
#define se second
#define lld long long
#define LINF 1000000000000000000LL
using namespace std;
#define MAXN 500010
pair<lld, lld> p[MAXN];
int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int N; cin >> N;
    for(int i = 1; i <= N; i++) cin >> p[i].fi >> p[i].se;
    sort(p+1, p+1+N);
    lld sum = 0;
    lld maxx = -LINF;
    lld rez = -LINF;
    for(int i = 1; i <= N; i++) {
        maxx = max(maxx, p[i].fi - sum);
        sum += p[i].se;
        rez = max(rez, maxx + sum - p[i].fi);
    }
    cout << rez;
}

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	512 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	384 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	492 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	404 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	512 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	384 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	492 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	404 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	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	3 ms	492 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct
31	Correct	3 ms	492 KB	Output is correct
32	Correct	3 ms	492 KB	Output is correct
33	Correct	2 ms	492 KB	Output is correct
34	Correct	3 ms	492 KB	Output is correct
35	Correct	3 ms	492 KB	Output is correct
36	Correct	3 ms	492 KB	Output is correct
37	Correct	3 ms	492 KB	Output is correct
38	Correct	4 ms	492 KB	Output is correct
39	Correct	2 ms	492 KB	Output is correct
40	Correct	2 ms	492 KB	Output is correct
41	Correct	3 ms	620 KB	Output is correct
42	Correct	2 ms	492 KB	Output is correct
43	Correct	2 ms	492 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	3 ms	492 KB	Output is correct
46	Correct	4 ms	492 KB	Output is correct
47	Correct	2 ms	492 KB	Output is correct
48	Correct	2 ms	492 KB	Output is correct
49	Correct	3 ms	492 KB	Output is correct
50	Correct	3 ms	492 KB	Output is correct
51	Correct	3 ms	492 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	512 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	384 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	492 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	404 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	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	3 ms	492 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct
31	Correct	3 ms	492 KB	Output is correct
32	Correct	3 ms	492 KB	Output is correct
33	Correct	2 ms	492 KB	Output is correct
34	Correct	3 ms	492 KB	Output is correct
35	Correct	3 ms	492 KB	Output is correct
36	Correct	3 ms	492 KB	Output is correct
37	Correct	3 ms	492 KB	Output is correct
38	Correct	4 ms	492 KB	Output is correct
39	Correct	2 ms	492 KB	Output is correct
40	Correct	2 ms	492 KB	Output is correct
41	Correct	3 ms	620 KB	Output is correct
42	Correct	2 ms	492 KB	Output is correct
43	Correct	2 ms	492 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	3 ms	492 KB	Output is correct
46	Correct	4 ms	492 KB	Output is correct
47	Correct	2 ms	492 KB	Output is correct
48	Correct	2 ms	492 KB	Output is correct
49	Correct	3 ms	492 KB	Output is correct
50	Correct	3 ms	492 KB	Output is correct
51	Correct	3 ms	492 KB	Output is correct
52	Correct	209 ms	20968 KB	Output is correct
53	Correct	202 ms	20972 KB	Output is correct
54	Correct	205 ms	20844 KB	Output is correct
55	Correct	229 ms	20844 KB	Output is correct
56	Correct	206 ms	20844 KB	Output is correct
57	Correct	216 ms	20844 KB	Output is correct
58	Correct	206 ms	20888 KB	Output is correct
59	Correct	209 ms	20844 KB	Output is correct
60	Correct	221 ms	20844 KB	Output is correct
61	Correct	201 ms	20688 KB	Output is correct
62	Correct	205 ms	20788 KB	Output is correct
63	Correct	197 ms	20844 KB	Output is correct
64	Correct	203 ms	20844 KB	Output is correct
65	Correct	206 ms	20844 KB	Output is correct
66	Correct	207 ms	20844 KB	Output is correct
67	Correct	200 ms	20844 KB	Output is correct
68	Correct	205 ms	20844 KB	Output is correct

Submission #331893

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