답안 #310732

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
310732	2020-10-07T18:06:51 Z	Leonardo_Paes	Art Exhibition (JOI18_art)	C++17	100 / 100	529 ms	24752 KB

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5+10;
long long tree[1<<20], lazy[1<<20];
void flush(int node, int l, int r){
    if(!lazy[node]) return;
    tree[node] += lazy[node];
    if(l!=r){
        lazy[2*node] += lazy[node];
        lazy[2*node+1] += lazy[node];
    }
    lazy[node] = 0;
}
void update(int node, int tl, int tr, int l, int r, long long v){
    flush(node, tl, tr);
    if(tl > r or tr < l) return;
    if(tl >= l and tr <= r){
        lazy[node] += v;
        flush(node, tl, tr);
        return;
    }
    int mid = (tl + tr) >> 1;
    update(2*node, tl, mid, l, r, v);
    update(2*node+1, mid+1, tr, l, r, v);
    tree[node] = max(tree[2*node], tree[2*node+1]);
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n;
    cin >> n;
    vector<array<long long, 2>> v(n);
    for(int i=0; i<n; i++) cin >> v[i][0] >> v[i][1];
    sort(v.begin(), v.end());
    long long ans = 0;
    for(int i=0; i<n; i++){
        update(1, 1, n, 1, i+1, v[i][1]);
        update(1, 1, n, i+1, i+1, v[i][0]);
        ans = max(ans, tree[1] - v[i][0]);
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	4 ms	640 KB	Output is correct
28	Correct	4 ms	640 KB	Output is correct
29	Correct	4 ms	640 KB	Output is correct
30	Correct	5 ms	640 KB	Output is correct
31	Correct	5 ms	640 KB	Output is correct
32	Correct	5 ms	640 KB	Output is correct
33	Correct	5 ms	640 KB	Output is correct
34	Correct	5 ms	640 KB	Output is correct
35	Correct	4 ms	640 KB	Output is correct
36	Correct	5 ms	640 KB	Output is correct
37	Correct	4 ms	640 KB	Output is correct
38	Correct	4 ms	640 KB	Output is correct
39	Correct	4 ms	640 KB	Output is correct
40	Correct	4 ms	640 KB	Output is correct
41	Correct	4 ms	640 KB	Output is correct
42	Correct	4 ms	640 KB	Output is correct
43	Correct	4 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	640 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	640 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	4 ms	640 KB	Output is correct
28	Correct	4 ms	640 KB	Output is correct
29	Correct	4 ms	640 KB	Output is correct
30	Correct	5 ms	640 KB	Output is correct
31	Correct	5 ms	640 KB	Output is correct
32	Correct	5 ms	640 KB	Output is correct
33	Correct	5 ms	640 KB	Output is correct
34	Correct	5 ms	640 KB	Output is correct
35	Correct	4 ms	640 KB	Output is correct
36	Correct	5 ms	640 KB	Output is correct
37	Correct	4 ms	640 KB	Output is correct
38	Correct	4 ms	640 KB	Output is correct
39	Correct	4 ms	640 KB	Output is correct
40	Correct	4 ms	640 KB	Output is correct
41	Correct	4 ms	640 KB	Output is correct
42	Correct	4 ms	640 KB	Output is correct
43	Correct	4 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	640 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	640 KB	Output is correct
52	Correct	520 ms	24540 KB	Output is correct
53	Correct	529 ms	24696 KB	Output is correct
54	Correct	519 ms	24696 KB	Output is correct
55	Correct	515 ms	24568 KB	Output is correct
56	Correct	511 ms	24700 KB	Output is correct
57	Correct	515 ms	24572 KB	Output is correct
58	Correct	515 ms	24568 KB	Output is correct
59	Correct	520 ms	24696 KB	Output is correct
60	Correct	515 ms	24700 KB	Output is correct
61	Correct	514 ms	24568 KB	Output is correct
62	Correct	514 ms	24568 KB	Output is correct
63	Correct	516 ms	24568 KB	Output is correct
64	Correct	512 ms	24568 KB	Output is correct
65	Correct	512 ms	24696 KB	Output is correct
66	Correct	518 ms	24568 KB	Output is correct
67	Correct	515 ms	24752 KB	Output is correct
68	Correct	512 ms	24696 KB	Output is correct

답안 #310732

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