답안 #103430

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
103430	2019-03-30T15:53:51 Z	Alliance	Art Exhibition (JOI18_art)	C++14	100 / 100	574 ms	25500 KB

// In the name of Allah. Ya ali!
#include<bits/stdc++.h>
#define double long double
typedef long long ll;
const ll MAX_N = 1.2e6+10;
const ll MOD = 1e9+7;
using namespace std;

ll mx[MAX_N];
ll fl[MAX_N];
pair<ll,ll> lr[MAX_N];
int n,y;

void shift(int k)
{
    int l = k*2;
    int r = k*2+1;
    fl[l] += fl[k];
    fl[r] += fl[k];
    mx[l] += fl[k];
    mx[r] += fl[k];
    fl[k] = 0;
}

void update(int k)
{
    mx[k] = max(mx[k*2],mx[k*2+1]);
}

void add(int l,int r,int a,int b,int k,ll x)
{
    if (r<a or b<l)
        return;
    if (a<=l and r<=b)
    {
        fl[k] += x;
        mx[k] += x;
        return;
    }
    int mid = (l+r)/2;
    shift(k);
    add(l,mid,a,b,k*2,x);
    add(mid+1,r,a,b,k*2+1,x);
    update(k);
}

int main()
{
    cin >> n;
    y = (1<<((int)ceil(log2(n))));
    ll ans = 0;
    for(int i = 0;i<n;++i)
        scanf("%lld%lld",&lr[i].first,&lr[i].second),ans = max(ans,lr[i].second);
    sort(lr,lr+n);
    add(0,y-1,0,0,1,lr[0].second);
    for(int i = 1;i<n;++i)
    {
        add(0,y-1,0,i-1,1,-lr[i].first+lr[i-1].first+lr[i].second);
        add(0,y-1,i,i,1,max(lr[i].second,mx[1]));
        ans = max(ans,mx[1]);
    }
    cout << ans;
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:53:53: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld",&lr[i].first,&lr[i].second),ans = max(ans,lr[i].second);
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	3 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	7 ms	640 KB	Output is correct
28	Correct	6 ms	640 KB	Output is correct
29	Correct	8 ms	640 KB	Output is correct
30	Correct	7 ms	640 KB	Output is correct
31	Correct	7 ms	640 KB	Output is correct
32	Correct	5 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	6 ms	640 KB	Output is correct
35	Correct	8 ms	640 KB	Output is correct
36	Correct	6 ms	560 KB	Output is correct
37	Correct	6 ms	640 KB	Output is correct
38	Correct	7 ms	640 KB	Output is correct
39	Correct	4 ms	640 KB	Output is correct
40	Correct	7 ms	640 KB	Output is correct
41	Correct	7 ms	640 KB	Output is correct
42	Correct	6 ms	640 KB	Output is correct
43	Correct	8 ms	640 KB	Output is correct
44	Correct	6 ms	640 KB	Output is correct
45	Correct	7 ms	640 KB	Output is correct
46	Correct	7 ms	640 KB	Output is correct
47	Correct	9 ms	640 KB	Output is correct
48	Correct	7 ms	640 KB	Output is correct
49	Correct	7 ms	640 KB	Output is correct
50	Correct	8 ms	640 KB	Output is correct
51	Correct	7 ms	640 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	3 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	7 ms	640 KB	Output is correct
28	Correct	6 ms	640 KB	Output is correct
29	Correct	8 ms	640 KB	Output is correct
30	Correct	7 ms	640 KB	Output is correct
31	Correct	7 ms	640 KB	Output is correct
32	Correct	5 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	6 ms	640 KB	Output is correct
35	Correct	8 ms	640 KB	Output is correct
36	Correct	6 ms	560 KB	Output is correct
37	Correct	6 ms	640 KB	Output is correct
38	Correct	7 ms	640 KB	Output is correct
39	Correct	4 ms	640 KB	Output is correct
40	Correct	7 ms	640 KB	Output is correct
41	Correct	7 ms	640 KB	Output is correct
42	Correct	6 ms	640 KB	Output is correct
43	Correct	8 ms	640 KB	Output is correct
44	Correct	6 ms	640 KB	Output is correct
45	Correct	7 ms	640 KB	Output is correct
46	Correct	7 ms	640 KB	Output is correct
47	Correct	9 ms	640 KB	Output is correct
48	Correct	7 ms	640 KB	Output is correct
49	Correct	7 ms	640 KB	Output is correct
50	Correct	8 ms	640 KB	Output is correct
51	Correct	7 ms	640 KB	Output is correct
52	Correct	574 ms	24024 KB	Output is correct
53	Correct	560 ms	24028 KB	Output is correct
54	Correct	541 ms	23860 KB	Output is correct
55	Correct	546 ms	23876 KB	Output is correct
56	Correct	529 ms	23904 KB	Output is correct
57	Correct	499 ms	24028 KB	Output is correct
58	Correct	475 ms	23864 KB	Output is correct
59	Correct	487 ms	23928 KB	Output is correct
60	Correct	518 ms	23928 KB	Output is correct
61	Correct	502 ms	23928 KB	Output is correct
62	Correct	472 ms	25464 KB	Output is correct
63	Correct	572 ms	25500 KB	Output is correct
64	Correct	478 ms	25472 KB	Output is correct
65	Correct	440 ms	25336 KB	Output is correct
66	Correct	454 ms	25464 KB	Output is correct
67	Correct	481 ms	25276 KB	Output is correct
68	Correct	540 ms	25336 KB	Output is correct

답안 #103430

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