oj.uz

답안 #377278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377278 2021-03-13T15:58:26 Z jass921026 Cake 3 (JOI19_cake3) C++14
100 / 100
 3761 ms 27628 KB 
#include<bits/stdc++.h>
using namespace std;
#define jizz ios_base::sync_with_stdio(false);cin.tie(NULL);
typedef long long ll;
typedef pair<int,int> pii;
#define F first
#define S second
const ll MAXN=2E5+10, INF=1E18;
int n, m, tmp[MAXN], pos[MAXN];
pii cake[MAXN];
ll ans[MAXN];
bool cmp(int a, int b){
    return cake[a].S<cake[b].S;
}
struct node{
    ll cnt=0, val=0;
    node* left=NULL;
    node* right=NULL;
    void pull(){
        cnt=left->cnt+right->cnt;
        val=left->val+right->val;
    }
    node(){};
    node(node* a, node* b){
        left=a, right=b;
        pull();
    }
};
node* root;
struct segment_tree{
    int L=0, R=-1;
    node* init(int l=0, int r=n-1){
        if(l==r) return new node();
        int mid=(l+r)/2;
        return new node(init(l,mid),init(mid+1,r));
    }
    void modify(int p, int v, node* now=root, int l=0, int r=n-1){
        if(l==r){
            now->cnt+=(v>0?1:-1);
            now->val+=v;
            return;
        }
        int mid=(l+r)/2;
        if(p<=mid) modify(p,v,now->left,l,mid);
        else modify(p,v,now->right,mid+1,r);
        now->pull();
    }
    ll query(int c=m, node* now=root, int l=0, int r=n-1){
        if(R-L+1<m) return -INF;
        if(c==0) return 0;
        if(c==now->cnt) return now->val;
        int mid=(l+r)/2;
        if(now->right->cnt<=c){
            return query(c-now->right->cnt,now->left,l,mid)+now->right->val;
        } else{
            return query(c,now->right,mid+1,r);
        }
    }
    void update(int l, int r){
        while(L>l){
            modify(pos[L-1],cake[L-1].S);
            L--;
        }
        while(R<r){
            modify(pos[R+1],cake[R+1].S);
            R++;
        }
        while(L<l){
            modify(pos[L],-cake[L].S);
            L++;
        }
        while(R>r){
            modify(pos[R],-cake[R].S);
            R--;
        }
    }
} sgt;
void solve(int l, int r, int ll, int rr){
    if(l>r) return;
    int mid=(l+r)/2, p=ll;
    long long penalty=0, sum=0;
    for(int i=ll;i<=rr;i++){
        if(i<mid) continue;
        penalty=2*(cake[i].F-cake[mid].F);
        sgt.update(mid,i);
        sum=sgt.query();
        //cout<<mid<<" "<<i<<" "<<sum<<" "<<penalty<<"\n";
        if(sum-penalty>ans[mid]){
            ans[mid]=sum-penalty;
            p=i;
        }
    }
    solve(l,mid-1,ll,p);
    solve(mid+1,r,p,rr);
}
int main(){ jizz
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>cake[i].S>>cake[i].F;
    }
    sort(cake,cake+n);
    for(int i=0;i<n;i++) tmp[i]=i;
    sort(tmp,tmp+n,cmp);
    for(int i=0;i<n;i++) pos[tmp[i]]=i;
    for(int i=0;i<n;i++) ans[i]=-INF;
    root=sgt.init();
    solve(0,n-m,0,n-1);
    ll ANS=-INF;
    for(int i=0;i<n;i++) ANS=max(ANS,ans[i]);
    cout<<ANS<<"\n";
    return 0;
}
/*
8 4
112103441 501365808
659752417 137957977
86280801 257419447
902409188 565237611
965602301 689654312
104535476 646977261
945132881 114821749
198700181 915994879
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 400 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 400 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 6 ms 620 KB Output is correct
39 Correct 7 ms 620 KB Output is correct
40 Correct 6 ms 620 KB Output is correct
41 Correct 6 ms 620 KB Output is correct
42 Correct 5 ms 620 KB Output is correct
43 Correct 5 ms 620 KB Output is correct
44 Correct 6 ms 620 KB Output is correct
45 Correct 7 ms 620 KB Output is correct
46 Correct 7 ms 620 KB Output is correct
47 Correct 8 ms 620 KB Output is correct
48 Correct 6 ms 620 KB Output is correct
49 Correct 6 ms 620 KB Output is correct
50 Correct 7 ms 640 KB Output is correct
51 Correct 6 ms 620 KB Output is correct
52 Correct 6 ms 620 KB Output is correct
53 Correct 7 ms 748 KB Output is correct
54 Correct 6 ms 620 KB Output is correct
55 Correct 5 ms 620 KB Output is correct
56 Correct 5 ms 620 KB Output is correct
57 Correct 5 ms 620 KB Output is correct
58 Correct 5 ms 620 KB Output is correct
59 Correct 5 ms 620 KB Output is correct
60 Correct 5 ms 620 KB Output is correct
61 Correct 5 ms 620 KB Output is correct
62 Correct 5 ms 620 KB Output is correct
63 Correct 5 ms 620 KB Output is correct
64 Correct 5 ms 620 KB Output is correct
65 Correct 6 ms 644 KB Output is correct
66 Correct 6 ms 620 KB Output is correct
67 Correct 6 ms 620 KB Output is correct
68 Correct 6 ms 620 KB Output is correct
69 Correct 6 ms 620 KB Output is correct
70 Correct 6 ms 620 KB Output is correct
71 Correct 44 ms 640 KB Output is correct
72 Correct 5 ms 620 KB Output is correct
73 Correct 6 ms 620 KB Output is correct
74 Correct 2 ms 620 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 400 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 6 ms 620 KB Output is correct
39 Correct 7 ms 620 KB Output is correct
40 Correct 6 ms 620 KB Output is correct
41 Correct 6 ms 620 KB Output is correct
42 Correct 5 ms 620 KB Output is correct
43 Correct 5 ms 620 KB Output is correct
44 Correct 6 ms 620 KB Output is correct
45 Correct 7 ms 620 KB Output is correct
46 Correct 7 ms 620 KB Output is correct
47 Correct 8 ms 620 KB Output is correct
48 Correct 6 ms 620 KB Output is correct
49 Correct 6 ms 620 KB Output is correct
50 Correct 7 ms 640 KB Output is correct
51 Correct 6 ms 620 KB Output is correct
52 Correct 6 ms 620 KB Output is correct
53 Correct 7 ms 748 KB Output is correct
54 Correct 6 ms 620 KB Output is correct
55 Correct 5 ms 620 KB Output is correct
56 Correct 5 ms 620 KB Output is correct
57 Correct 5 ms 620 KB Output is correct
58 Correct 5 ms 620 KB Output is correct
59 Correct 5 ms 620 KB Output is correct
60 Correct 5 ms 620 KB Output is correct
61 Correct 5 ms 620 KB Output is correct
62 Correct 5 ms 620 KB Output is correct
63 Correct 5 ms 620 KB Output is correct
64 Correct 5 ms 620 KB Output is correct
65 Correct 6 ms 644 KB Output is correct
66 Correct 6 ms 620 KB Output is correct
67 Correct 6 ms 620 KB Output is correct
68 Correct 6 ms 620 KB Output is correct
69 Correct 6 ms 620 KB Output is correct
70 Correct 6 ms 620 KB Output is correct
71 Correct 44 ms 640 KB Output is correct
72 Correct 5 ms 620 KB Output is correct
73 Correct 6 ms 620 KB Output is correct
74 Correct 2 ms 620 KB Output is correct
75 Correct 3529 ms 25880 KB Output is correct
76 Correct 3700 ms 25192 KB Output is correct
77 Correct 3495 ms 25940 KB Output is correct
78 Correct 3590 ms 26348 KB Output is correct
79 Correct 1611 ms 26412 KB Output is correct
80 Correct 2478 ms 25708 KB Output is correct
81 Correct 3243 ms 25384 KB Output is correct
82 Correct 3544 ms 25748 KB Output is correct
83 Correct 3658 ms 26560 KB Output is correct
84 Correct 3761 ms 26604 KB Output is correct
85 Correct 3426 ms 25592 KB Output is correct
86 Correct 2850 ms 24752 KB Output is correct
87 Correct 2841 ms 24432 KB Output is correct
88 Correct 3102 ms 24272 KB Output is correct
89 Correct 3297 ms 25704 KB Output is correct
90 Correct 3306 ms 26732 KB Output is correct
91 Correct 2787 ms 24748 KB Output is correct
92 Correct 2685 ms 24556 KB Output is correct
93 Correct 3005 ms 25644 KB Output is correct
94 Correct 2999 ms 26660 KB Output is correct
95 Correct 3148 ms 26736 KB Output is correct
96 Correct 1059 ms 24812 KB Output is correct
97 Correct 1224 ms 26860 KB Output is correct
98 Correct 1175 ms 26476 KB Output is correct
99 Correct 1113 ms 26348 KB Output is correct
100 Correct 1030 ms 24944 KB Output is correct
101 Correct 1042 ms 24944 KB Output is correct
102 Correct 1798 ms 25068 KB Output is correct
103 Correct 1741 ms 24620 KB Output is correct
104 Correct 1805 ms 26092 KB Output is correct
105 Correct 1947 ms 25928 KB Output is correct
106 Correct 2011 ms 26652 KB Output is correct
107 Correct 1865 ms 25708 KB Output is correct
108 Correct 3547 ms 26092 KB Output is correct
109 Correct 3723 ms 27536 KB Output is correct
110 Correct 1756 ms 24684 KB Output is correct
111 Correct 1859 ms 24960 KB Output is correct
112 Correct 1110 ms 23808 KB Output is correct
113 Correct 225 ms 27628 KB Output is correct