Submission #146928

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
146928	2019-08-26T16:48:41 Z	willi19	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	32932 KB

art

#include <bits/stdc++.h>
using namespace std;
int n;
long long maxt[2000100],ans,val[500100];
pair<long long,long long> pic[500100];
void init(int s,int f,int node)
{
    if(s==f)
    {
        maxt[node]=val[s];
        return;
    }
    init(s,(s+f)/2,node*2);
    init((s+f)/2+1,f,node*2+1);
    maxt[node]=max(maxt[node*2],maxt[node*2+1]);
}
long long query(int s,int f,int node,int l,int r)
{
    if(f<l||r<s)
        return -100000000000000000;
    if(l<=s&&f<=r)
        return maxt[node];
    return max(query(s,(s+f)/2,node*2,l,r),query((s+f)/2+1,f,node*2+1,l,r));
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>pic[i].first>>pic[i].second;
    sort(pic+1,pic+n+1);
    for(int i=1;i<=n;i++)
        val[i]+=(val[i-1]+pic[i-1].first-pic[i].first+pic[i].second);
    init(1,n,1);
    ans=0;
    for(int i=1;i<n;i++)
    {
        ans=max(ans,query(1,n,1,i,n)-val[i]+pic[i].second);
        //cout<<query(1,n,1,i+1,n)-val[i]+pic[i].second<<"\n";
    }
    cout<<ans;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	3 ms	380 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	3 ms	380 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	7 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	12 ms	764 KB	Output is correct
28	Correct	13 ms	732 KB	Output is correct
29	Correct	12 ms	760 KB	Output is correct
30	Correct	12 ms	760 KB	Output is correct
31	Correct	12 ms	760 KB	Output is correct
32	Correct	13 ms	760 KB	Output is correct
33	Correct	12 ms	632 KB	Output is correct
34	Correct	12 ms	732 KB	Output is correct
35	Correct	12 ms	732 KB	Output is correct
36	Correct	12 ms	764 KB	Output is correct
37	Correct	12 ms	760 KB	Output is correct
38	Correct	12 ms	760 KB	Output is correct
39	Correct	12 ms	760 KB	Output is correct
40	Correct	12 ms	732 KB	Output is correct
41	Correct	12 ms	760 KB	Output is correct
42	Correct	12 ms	764 KB	Output is correct
43	Correct	12 ms	636 KB	Output is correct
44	Correct	12 ms	760 KB	Output is correct
45	Correct	12 ms	760 KB	Output is correct
46	Correct	13 ms	792 KB	Output is correct
47	Correct	12 ms	760 KB	Output is correct
48	Correct	12 ms	760 KB	Output is correct
49	Correct	12 ms	632 KB	Output is correct
50	Correct	12 ms	632 KB	Output is correct
51	Correct	12 ms	760 KB	Output is correct
52	Execution timed out	1060 ms	32932 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-