Submission #713269

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
713269	2023-03-21T15:11:46 Z	Spade1	Art Exhibition (JOI18_art)	C++14	100 / 100	226 ms	28656 KB

#include<bits/stdc++.h>
//#include <grader.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;

const int N = 5e5 + 10;

pll a[N];
ll b[N], c[N], qs[N], qss[N];

void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i].st >> a[i].nd;
    sort(a+1, a+n+1);
    for (int i = 1; i <= n; ++i) b[i] = -(a[i].st - a[i-1].st) + a[i].nd;
    for (int i = 1; i <= n; ++i) b[i] += b[i-1];
    c[n] = b[n];
    for (int i = n-1; i >= 1; --i) c[i] = max(c[i+1], b[i]);
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
        ans = max(ans, a[i].st-a[i-1].st + c[i] - b[i-1]);
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}
/*

*/

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	380 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 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	340 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	336 KB	Output is correct
22	Correct	1 ms	340 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	336 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	380 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 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	340 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	336 KB	Output is correct
22	Correct	1 ms	340 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	336 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	3 ms	604 KB	Output is correct
28	Correct	3 ms	588 KB	Output is correct
29	Correct	3 ms	528 KB	Output is correct
30	Correct	3 ms	580 KB	Output is correct
31	Correct	3 ms	592 KB	Output is correct
32	Correct	3 ms	596 KB	Output is correct
33	Correct	3 ms	600 KB	Output is correct
34	Correct	3 ms	584 KB	Output is correct
35	Correct	3 ms	600 KB	Output is correct
36	Correct	3 ms	584 KB	Output is correct
37	Correct	3 ms	596 KB	Output is correct
38	Correct	2 ms	596 KB	Output is correct
39	Correct	3 ms	600 KB	Output is correct
40	Correct	3 ms	584 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct
42	Correct	3 ms	600 KB	Output is correct
43	Correct	3 ms	612 KB	Output is correct
44	Correct	3 ms	596 KB	Output is correct
45	Correct	3 ms	600 KB	Output is correct
46	Correct	3 ms	596 KB	Output is correct
47	Correct	3 ms	596 KB	Output is correct
48	Correct	3 ms	596 KB	Output is correct
49	Correct	3 ms	596 KB	Output is correct
50	Correct	3 ms	596 KB	Output is correct
51	Correct	3 ms	596 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	380 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 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	340 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	336 KB	Output is correct
22	Correct	1 ms	340 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	336 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	3 ms	604 KB	Output is correct
28	Correct	3 ms	588 KB	Output is correct
29	Correct	3 ms	528 KB	Output is correct
30	Correct	3 ms	580 KB	Output is correct
31	Correct	3 ms	592 KB	Output is correct
32	Correct	3 ms	596 KB	Output is correct
33	Correct	3 ms	600 KB	Output is correct
34	Correct	3 ms	584 KB	Output is correct
35	Correct	3 ms	600 KB	Output is correct
36	Correct	3 ms	584 KB	Output is correct
37	Correct	3 ms	596 KB	Output is correct
38	Correct	2 ms	596 KB	Output is correct
39	Correct	3 ms	600 KB	Output is correct
40	Correct	3 ms	584 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct
42	Correct	3 ms	600 KB	Output is correct
43	Correct	3 ms	612 KB	Output is correct
44	Correct	3 ms	596 KB	Output is correct
45	Correct	3 ms	600 KB	Output is correct
46	Correct	3 ms	596 KB	Output is correct
47	Correct	3 ms	596 KB	Output is correct
48	Correct	3 ms	596 KB	Output is correct
49	Correct	3 ms	596 KB	Output is correct
50	Correct	3 ms	596 KB	Output is correct
51	Correct	3 ms	596 KB	Output is correct
52	Correct	188 ms	28532 KB	Output is correct
53	Correct	203 ms	28520 KB	Output is correct
54	Correct	195 ms	28548 KB	Output is correct
55	Correct	206 ms	28612 KB	Output is correct
56	Correct	184 ms	28608 KB	Output is correct
57	Correct	197 ms	28492 KB	Output is correct
58	Correct	206 ms	28652 KB	Output is correct
59	Correct	205 ms	28500 KB	Output is correct
60	Correct	207 ms	28656 KB	Output is correct
61	Correct	188 ms	28504 KB	Output is correct
62	Correct	186 ms	28604 KB	Output is correct
63	Correct	225 ms	28584 KB	Output is correct
64	Correct	208 ms	28592 KB	Output is correct
65	Correct	203 ms	28548 KB	Output is correct
66	Correct	193 ms	28532 KB	Output is correct
67	Correct	226 ms	28640 KB	Output is correct
68	Correct	197 ms	28596 KB	Output is correct

Submission #713269

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