Submission #1033836

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1033836	2024-07-25T06:51:01 Z	toan2602	Art Exhibition (JOI18_art)	C++14	100 / 100	246 ms	37456 KB

#include<bits/stdc++.h>

using namespace std;
#define int long long
int n;
pair<int, int> a[500005];
struct Segtree {
    int val[2000005], lazy[2000005];
    void push(int id, int l, int r) {
        val[id] += lazy[id];
        if(l != r) lazy[id*2] += lazy[id], lazy[id*2+1] += lazy[id];
        lazy[id] = 0;
    }
    void update(int id, int l, int r, int u, int v, int nw) {
        if(l > v || r < u) return;
        if(l >= u && r <= v) {
            val[id] += nw;
            if(l != r) {
                lazy[id*2] += nw;
                lazy[id*2+1] += nw;
            }
            return;
        }
        int mid = (l + r) / 2;
        update(id*2, l, mid, u, v, nw);
        update(id*2+1, mid + 1, r, u, v, nw);
        val[id] = max(val[id*2], val[id*2+1]);
    }
} tree;
void solve() {
    cin >> n;
    int res = 0;
    for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second, res = max(res, a[i].second);
    sort(a+1,a+1+n);
    for (int i = 1; i <= n; i++) {
        tree.update(1, 1, n, 1, i-1, a[i].second - (a[i].first - a[i-1].first));
        tree.update(1, 1, n, i, i, a[i].second);
        res = max(res, tree.val[1]);
    }
    cout << res;
}

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

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	460 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	348 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	460 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	0 ms	464 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	1 ms	348 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	460 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	0 ms	464 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	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	2 ms	860 KB	Output is correct
29	Correct	3 ms	860 KB	Output is correct
30	Correct	3 ms	860 KB	Output is correct
31	Correct	2 ms	860 KB	Output is correct
32	Correct	3 ms	860 KB	Output is correct
33	Correct	3 ms	860 KB	Output is correct
34	Correct	2 ms	856 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	2 ms	860 KB	Output is correct
38	Correct	2 ms	860 KB	Output is correct
39	Correct	2 ms	860 KB	Output is correct
40	Correct	2 ms	860 KB	Output is correct
41	Correct	2 ms	852 KB	Output is correct
42	Correct	2 ms	860 KB	Output is correct
43	Correct	2 ms	860 KB	Output is correct
44	Correct	2 ms	860 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	860 KB	Output is correct
47	Correct	2 ms	860 KB	Output is correct
48	Correct	3 ms	848 KB	Output is correct
49	Correct	2 ms	860 KB	Output is correct
50	Correct	2 ms	792 KB	Output is correct
51	Correct	2 ms	860 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	0 ms	348 KB	Output is correct
3	Correct	0 ms	460 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	0 ms	464 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	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	2 ms	860 KB	Output is correct
29	Correct	3 ms	860 KB	Output is correct
30	Correct	3 ms	860 KB	Output is correct
31	Correct	2 ms	860 KB	Output is correct
32	Correct	3 ms	860 KB	Output is correct
33	Correct	3 ms	860 KB	Output is correct
34	Correct	2 ms	856 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	2 ms	860 KB	Output is correct
38	Correct	2 ms	860 KB	Output is correct
39	Correct	2 ms	860 KB	Output is correct
40	Correct	2 ms	860 KB	Output is correct
41	Correct	2 ms	852 KB	Output is correct
42	Correct	2 ms	860 KB	Output is correct
43	Correct	2 ms	860 KB	Output is correct
44	Correct	2 ms	860 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	860 KB	Output is correct
47	Correct	2 ms	860 KB	Output is correct
48	Correct	3 ms	848 KB	Output is correct
49	Correct	2 ms	860 KB	Output is correct
50	Correct	2 ms	792 KB	Output is correct
51	Correct	2 ms	860 KB	Output is correct
52	Correct	246 ms	36988 KB	Output is correct
53	Correct	222 ms	37060 KB	Output is correct
54	Correct	209 ms	36948 KB	Output is correct
55	Correct	205 ms	36944 KB	Output is correct
56	Correct	208 ms	36948 KB	Output is correct
57	Correct	217 ms	36852 KB	Output is correct
58	Correct	219 ms	37008 KB	Output is correct
59	Correct	206 ms	36960 KB	Output is correct
60	Correct	203 ms	36948 KB	Output is correct
61	Correct	206 ms	36720 KB	Output is correct
62	Correct	201 ms	37004 KB	Output is correct
63	Correct	216 ms	37184 KB	Output is correct
64	Correct	227 ms	37200 KB	Output is correct
65	Correct	203 ms	37456 KB	Output is correct
66	Correct	203 ms	37200 KB	Output is correct
67	Correct	223 ms	37196 KB	Output is correct
68	Correct	205 ms	37204 KB	Output is correct

Submission #1033836

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