Submission #208276

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
208276	2020-03-10T13:39:47 Z	Autoratch	Art Exhibition (JOI18_art)	C++14	100 / 100	314 ms	33152 KB

#include <bits/stdc++.h>
using namespace std;

const int N = 1 << 19;

int n;
long long ans,b[N];
pair<long long,long long> a[N];
struct node{ long long val; friend node operator+(const node &a,const node &b){ if(a.val>b.val) return a; else return b; } };
node tree[N << 1];

void build(int l,int r,int idx)
{
    if(l==r) return void(tree[idx].val = a[l].second);
    int m = (l+r)/2;
    build(l,m,idx*2),build(m+1,r,idx*2+1);
    tree[idx] = tree[idx*2]+tree[idx*2+1];
}

node read(int l,int r,int idx,int x,int y)
{
    if(x>r or y<l) return {LLONG_MIN};
    if(x<=l and y>=r) return tree[idx];
    int m = (l+r)/2;
    return read(l,m,idx*2,x,y)+read(m+1,r,idx*2+1,x,y);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i].first >> a[i].second;
    sort(a+1,a+n+1);
    for(int i = 1;i <= n;i++) b[i] = a[i].second;
    for(int i = 2;i <= n;i++) a[i].second-=a[i].first-a[i-1].first;
    for(int i = 2;i <= n;i++) a[i].second+=a[i-1].second;
    build(1,n,1);
    for(int i = 1;i < n;i++)
    {
        long long each = read(1,n,1,i+1,n).val;
        if(each==LLONG_MIN) each = -1;
        each-=a[i].second;
        ans = max(ans,b[i]+max(each,0LL));
    }
    ans = max(ans,b[n]);
    cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	4 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	380 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	428 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	380 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	7 ms	760 KB	Output is correct
28	Correct	7 ms	760 KB	Output is correct
29	Correct	7 ms	760 KB	Output is correct
30	Correct	7 ms	760 KB	Output is correct
31	Correct	8 ms	760 KB	Output is correct
32	Correct	7 ms	760 KB	Output is correct
33	Correct	7 ms	760 KB	Output is correct
34	Correct	8 ms	760 KB	Output is correct
35	Correct	8 ms	760 KB	Output is correct
36	Correct	7 ms	660 KB	Output is correct
37	Correct	7 ms	760 KB	Output is correct
38	Correct	7 ms	760 KB	Output is correct
39	Correct	7 ms	760 KB	Output is correct
40	Correct	7 ms	760 KB	Output is correct
41	Correct	7 ms	760 KB	Output is correct
42	Correct	8 ms	760 KB	Output is correct
43	Correct	7 ms	760 KB	Output is correct
44	Correct	8 ms	764 KB	Output is correct
45	Correct	7 ms	760 KB	Output is correct
46	Correct	7 ms	760 KB	Output is correct
47	Correct	7 ms	760 KB	Output is correct
48	Correct	7 ms	760 KB	Output is correct
49	Correct	7 ms	760 KB	Output is correct
50	Correct	7 ms	760 KB	Output is correct
51	Correct	7 ms	760 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	4 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	380 KB	Output is correct
9	Correct	5 ms	376 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	376 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	428 KB	Output is correct
14	Correct	5 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	5 ms	380 KB	Output is correct
19	Correct	5 ms	376 KB	Output is correct
20	Correct	5 ms	376 KB	Output is correct
21	Correct	5 ms	376 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	7 ms	760 KB	Output is correct
28	Correct	7 ms	760 KB	Output is correct
29	Correct	7 ms	760 KB	Output is correct
30	Correct	7 ms	760 KB	Output is correct
31	Correct	8 ms	760 KB	Output is correct
32	Correct	7 ms	760 KB	Output is correct
33	Correct	7 ms	760 KB	Output is correct
34	Correct	8 ms	760 KB	Output is correct
35	Correct	8 ms	760 KB	Output is correct
36	Correct	7 ms	660 KB	Output is correct
37	Correct	7 ms	760 KB	Output is correct
38	Correct	7 ms	760 KB	Output is correct
39	Correct	7 ms	760 KB	Output is correct
40	Correct	7 ms	760 KB	Output is correct
41	Correct	7 ms	760 KB	Output is correct
42	Correct	8 ms	760 KB	Output is correct
43	Correct	7 ms	760 KB	Output is correct
44	Correct	8 ms	764 KB	Output is correct
45	Correct	7 ms	760 KB	Output is correct
46	Correct	7 ms	760 KB	Output is correct
47	Correct	7 ms	760 KB	Output is correct
48	Correct	7 ms	760 KB	Output is correct
49	Correct	7 ms	760 KB	Output is correct
50	Correct	7 ms	760 KB	Output is correct
51	Correct	7 ms	760 KB	Output is correct
52	Correct	306 ms	32892 KB	Output is correct
53	Correct	299 ms	32884 KB	Output is correct
54	Correct	304 ms	32992 KB	Output is correct
55	Correct	304 ms	32888 KB	Output is correct
56	Correct	309 ms	32888 KB	Output is correct
57	Correct	291 ms	33016 KB	Output is correct
58	Correct	306 ms	33060 KB	Output is correct
59	Correct	309 ms	32996 KB	Output is correct
60	Correct	298 ms	33152 KB	Output is correct
61	Correct	295 ms	32760 KB	Output is correct
62	Correct	314 ms	32916 KB	Output is correct
63	Correct	307 ms	32908 KB	Output is correct
64	Correct	294 ms	32888 KB	Output is correct
65	Correct	285 ms	33016 KB	Output is correct
66	Correct	304 ms	32948 KB	Output is correct
67	Correct	295 ms	32888 KB	Output is correct
68	Correct	301 ms	33144 KB	Output is correct

Submission #208276

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