Submission #1033952

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1033952	2024-07-25T08:05:16 Z	vjudge1	Art Exhibition (JOI18_art)	C++14	100 / 100	231 ms	33300 KB

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define all(v) v.begin(), v.end()
using namespace std;

const int maxn = 5e5 + 5, oo = 1e18;
int st[maxn*4 + 5];

void build(int id, int l, int r, int vals[]){
    if (l == r){
        st[id] = vals[l];
        return;
    }
    int mid = (l + r)/2;
    build(id*2, l, mid, vals);
    build(id*2+1, mid+1, r, vals);
    st[id] = max(st[id*2], st[id*2+1]);
}

int get(int id, int l, int r, int ul, int ur){
    if (l > ur || r < ul) return -oo;
    if (ul <= l && r <= ur) return st[id];
    int mid = (l + r)/2;
    return max(get(id*2, l, mid, ul, ur), get(id*2+1, mid+1, r, ul, ur));
}

signed main(){
    cin.tie(0) -> sync_with_stdio(0);
    int n;
    cin >> n;
    pair<int, int> a[n+1];
    int vals[n+1] = {0};
    for (int i = 1; i <= n; i++){
        cin >> a[i].fi >> a[i].se;
    }
    sort(a+1, a+1+n);
    for (int i = 1; i <= n; i++){
        swap(a[i].fi, a[i].se);
    }
    for (int i = 2; i <= n; i++){
        a[i].fi += a[i-1].fi;
    }
    for (int i = 1; i <= n; i++){
        vals[i] = a[i].fi - a[i].se;
    }
    build(1, 1, n, vals);
    int mx = 0;
    for (int i = 1; i <= n; i++){
        mx = max(mx, get(1, 1, n, i, n) + a[i].se - a[i-1].fi);
    }
    cout << mx;
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	344 KB	Output is correct
9	Correct	360 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	360 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	468 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	732 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	2 ms	708 KB	Output is correct
34	Correct	2 ms	732 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	2 ms	600 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	604 KB	Output is correct
40	Correct	2 ms	604 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	2 ms	836 KB	Output is correct
43	Correct	2 ms	600 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	3 ms	860 KB	Output is correct
50	Correct	2 ms	600 KB	Output is correct
51	Correct	2 ms	696 KB	Output is correct
52	Correct	178 ms	33108 KB	Output is correct
53	Correct	186 ms	33152 KB	Output is correct
54	Correct	182 ms	33300 KB	Output is correct
55	Correct	174 ms	33104 KB	Output is correct
56	Correct	200 ms	33152 KB	Output is correct
57	Correct	181 ms	33104 KB	Output is correct
58	Correct	183 ms	33152 KB	Output is correct
59	Correct	231 ms	33104 KB	Output is correct
60	Correct	177 ms	33108 KB	Output is correct
61	Correct	173 ms	32852 KB	Output is correct
62	Correct	185 ms	33036 KB	Output is correct
63	Correct	172 ms	33164 KB	Output is correct
64	Correct	179 ms	33200 KB	Output is correct
65	Correct	172 ms	33152 KB	Output is correct
66	Correct	169 ms	33108 KB	Output is correct
67	Correct	179 ms	33108 KB	Output is correct
68	Correct	172 ms	33028 KB	Output is correct

Submission #1033952

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