답안 #235684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235684	2020-05-29T11:03:32 Z	zaneyu	Art Exhibition (JOI18_art)	C++14	100 / 100	640 ms	52344 KB

/*input
6
1000000000000000 1000000000
1000000000000000 1000000000
1000000000000000 1000000000
1000000000000000 1000000000
1000000000000000 1000000000
1000000000000000 1000000000
*/ 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,ll>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
#define int ll
struct node{
    ll mx,lazy=0;
}seg[4*maxn];
node pull(node a,node b){
    node x;
    x.mx=max(a.mx,b.mx);
    return x;
}
void pushdown(int idx,int l,int r){
    if(!seg[idx].lazy) return;
    seg[idx].mx+=seg[idx].lazy;
    if(l==r){
        seg[idx].lazy=0;
        return;
    }
    seg[idx*2].lazy+=seg[idx].lazy;
    seg[idx*2+1].lazy+=seg[idx].lazy;
    seg[idx].lazy=0;
}
void upd(int idx,int l,int r,int ql,int qr,int x){
    pushdown(idx,l,r);
    if(r<ql or l>qr) return;
    if(ql<=l and r<=qr){
        seg[idx].lazy+=x;
        pushdown(idx,l,r);
        return;
    }
    int mid=(l+r)/2;
    upd(idx*2,l,mid,ql,qr,x);
    upd(idx*2+1,mid+1,r,ql,qr,x);
    seg[idx]=pull(seg[idx*2],seg[idx*2+1]);
}
ll query(int idx,int l,int r,int ql,int qr){
    if(r<ql or l>qr) return -INF64;
    pushdown(idx,l,r);
    if(ql<=l and r<=qr){
        return seg[idx].mx;
    }
    int mid=(l+r)/2;
    return max(query(idx*2,l,mid,ql,qr),query(idx*2+1,mid+1,r,ql,qr));
}
pii arr[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    REP(i,n) cin>>arr[i].f>>arr[i].s;
    sort(arr,arr+n);
    ll ans=0;
    REP(i,n){
        upd(1,0,n-1,0,i,arr[i].s);
        upd(1,0,n-1,i,i,arr[i].f);
        MXTO(ans,query(1,0,n-1,0,i)-arr[i].f);
    }
    cout<<ans<<'\n';
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	19 ms	31616 KB	Output is correct
2	Correct	19 ms	31616 KB	Output is correct
3	Correct	19 ms	31616 KB	Output is correct
4	Correct	19 ms	31616 KB	Output is correct
5	Correct	19 ms	31616 KB	Output is correct
6	Correct	19 ms	31616 KB	Output is correct
7	Correct	19 ms	31616 KB	Output is correct
8	Correct	18 ms	31616 KB	Output is correct
9	Correct	20 ms	31616 KB	Output is correct
10	Correct	19 ms	31616 KB	Output is correct
11	Correct	19 ms	31616 KB	Output is correct
12	Correct	19 ms	31616 KB	Output is correct
13	Correct	19 ms	31616 KB	Output is correct
14	Correct	19 ms	31616 KB	Output is correct
15	Correct	19 ms	31660 KB	Output is correct
16	Correct	19 ms	31616 KB	Output is correct
17	Correct	19 ms	31616 KB	Output is correct
18	Correct	20 ms	31616 KB	Output is correct
19	Correct	20 ms	31744 KB	Output is correct
20	Correct	20 ms	31616 KB	Output is correct
21	Correct	20 ms	31744 KB	Output is correct
22	Correct	19 ms	31616 KB	Output is correct
23	Correct	19 ms	31616 KB	Output is correct
24	Correct	19 ms	31616 KB	Output is correct
25	Correct	20 ms	31616 KB	Output is correct
26	Correct	19 ms	31744 KB	Output is correct
27	Correct	24 ms	31744 KB	Output is correct
28	Correct	23 ms	31744 KB	Output is correct
29	Correct	24 ms	31744 KB	Output is correct
30	Correct	24 ms	31772 KB	Output is correct
31	Correct	24 ms	31744 KB	Output is correct
32	Correct	23 ms	31744 KB	Output is correct
33	Correct	23 ms	31744 KB	Output is correct
34	Correct	23 ms	31744 KB	Output is correct
35	Correct	23 ms	31744 KB	Output is correct
36	Correct	23 ms	31744 KB	Output is correct
37	Correct	23 ms	31744 KB	Output is correct
38	Correct	23 ms	31744 KB	Output is correct
39	Correct	23 ms	31744 KB	Output is correct
40	Correct	23 ms	31744 KB	Output is correct
41	Correct	23 ms	31744 KB	Output is correct
42	Correct	23 ms	31744 KB	Output is correct
43	Correct	25 ms	31776 KB	Output is correct
44	Correct	23 ms	31744 KB	Output is correct
45	Correct	24 ms	31744 KB	Output is correct
46	Correct	23 ms	31744 KB	Output is correct
47	Correct	24 ms	31744 KB	Output is correct
48	Correct	24 ms	31744 KB	Output is correct
49	Correct	25 ms	31744 KB	Output is correct
50	Correct	27 ms	31744 KB	Output is correct
51	Correct	24 ms	31744 KB	Output is correct
52	Correct	609 ms	39632 KB	Output is correct
53	Correct	602 ms	52344 KB	Output is correct
54	Correct	617 ms	52344 KB	Output is correct
55	Correct	602 ms	52216 KB	Output is correct
56	Correct	612 ms	52088 KB	Output is correct
57	Correct	606 ms	52088 KB	Output is correct
58	Correct	605 ms	52088 KB	Output is correct
59	Correct	616 ms	52088 KB	Output is correct
60	Correct	596 ms	52216 KB	Output is correct
61	Correct	608 ms	52088 KB	Output is correct
62	Correct	612 ms	52216 KB	Output is correct
63	Correct	614 ms	52216 KB	Output is correct
64	Correct	612 ms	52088 KB	Output is correct
65	Correct	639 ms	52220 KB	Output is correct
66	Correct	614 ms	52216 KB	Output is correct
67	Correct	605 ms	52240 KB	Output is correct
68	Correct	640 ms	52236 KB	Output is correct

답안 #235684

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