답안 #235683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235683	2020-05-29T11:03:02 Z	zaneyu	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	52064 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(){
    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	20 ms	31616 KB	Output is correct
3	Correct	20 ms	31616 KB	Output is correct
4	Correct	20 ms	31616 KB	Output is correct
5	Correct	19 ms	31616 KB	Output is correct
6	Correct	20 ms	31616 KB	Output is correct
7	Correct	19 ms	31616 KB	Output is correct
8	Correct	19 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	20 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	20 ms	31616 KB	Output is correct
3	Correct	20 ms	31616 KB	Output is correct
4	Correct	20 ms	31616 KB	Output is correct
5	Correct	19 ms	31616 KB	Output is correct
6	Correct	20 ms	31616 KB	Output is correct
7	Correct	19 ms	31616 KB	Output is correct
8	Correct	19 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	20 ms	31616 KB	Output is correct
12	Correct	21 ms	31616 KB	Output is correct
13	Correct	20 ms	31616 KB	Output is correct
14	Correct	20 ms	31616 KB	Output is correct
15	Correct	20 ms	31616 KB	Output is correct
16	Correct	21 ms	31616 KB	Output is correct
17	Correct	20 ms	31616 KB	Output is correct
18	Correct	20 ms	31616 KB	Output is correct
19	Correct	21 ms	31616 KB	Output is correct
20	Correct	19 ms	31616 KB	Output is correct
21	Correct	20 ms	31616 KB	Output is correct
22	Correct	20 ms	31616 KB	Output is correct
23	Correct	20 ms	31616 KB	Output is correct
24	Correct	20 ms	31616 KB	Output is correct
25	Correct	21 ms	31616 KB	Output is correct
26	Correct	21 ms	31616 KB	Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	19 ms	31616 KB	Output is correct
2	Correct	20 ms	31616 KB	Output is correct
3	Correct	20 ms	31616 KB	Output is correct
4	Correct	20 ms	31616 KB	Output is correct
5	Correct	19 ms	31616 KB	Output is correct
6	Correct	20 ms	31616 KB	Output is correct
7	Correct	19 ms	31616 KB	Output is correct
8	Correct	19 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	20 ms	31616 KB	Output is correct
12	Correct	21 ms	31616 KB	Output is correct
13	Correct	20 ms	31616 KB	Output is correct
14	Correct	20 ms	31616 KB	Output is correct
15	Correct	20 ms	31616 KB	Output is correct
16	Correct	21 ms	31616 KB	Output is correct
17	Correct	20 ms	31616 KB	Output is correct
18	Correct	20 ms	31616 KB	Output is correct
19	Correct	21 ms	31616 KB	Output is correct
20	Correct	19 ms	31616 KB	Output is correct
21	Correct	20 ms	31616 KB	Output is correct
22	Correct	20 ms	31616 KB	Output is correct
23	Correct	20 ms	31616 KB	Output is correct
24	Correct	20 ms	31616 KB	Output is correct
25	Correct	21 ms	31616 KB	Output is correct
26	Correct	21 ms	31616 KB	Output is correct
27	Correct	29 ms	31872 KB	Output is correct
28	Correct	30 ms	31864 KB	Output is correct
29	Correct	31 ms	31872 KB	Output is correct
30	Correct	30 ms	31872 KB	Output is correct
31	Correct	30 ms	31872 KB	Output is correct
32	Correct	30 ms	31872 KB	Output is correct
33	Correct	31 ms	31864 KB	Output is correct
34	Correct	29 ms	31872 KB	Output is correct
35	Correct	29 ms	31872 KB	Output is correct
36	Correct	29 ms	31872 KB	Output is correct
37	Correct	29 ms	31872 KB	Output is correct
38	Correct	30 ms	31872 KB	Output is correct
39	Correct	30 ms	31864 KB	Output is correct
40	Correct	29 ms	31872 KB	Output is correct
41	Correct	29 ms	31872 KB	Output is correct
42	Correct	30 ms	31872 KB	Output is correct
43	Correct	31 ms	31872 KB	Output is correct
44	Correct	30 ms	31872 KB	Output is correct
45	Correct	30 ms	31872 KB	Output is correct
46	Correct	30 ms	31872 KB	Output is correct
47	Correct	30 ms	31872 KB	Output is correct
48	Correct	29 ms	31864 KB	Output is correct
49	Correct	30 ms	31872 KB	Output is correct
50	Correct	30 ms	31744 KB	Output is correct
51	Correct	30 ms	31872 KB	Output is correct
52	Execution timed out	1096 ms	52064 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #235683

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0