oj.uz

답안 #788599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788599 2023-07-20T11:54:34 Z Ahmed57 Cake 3 (JOI19_cake3) C++17
100 / 100
 1281 ms 21632 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
vector<long long> pref;
long long cl = 0 ,cr = -1 , sz;
struct node{
    long long cnt = 0 , sum =0;
    node():cnt(0),sum(0){};
}seg[800001];
void build(int p,int l,int r){
    if(l==r){
        seg[p].cnt = 0;seg[p].sum = 0;
        return ;
    }
    int md = (l+r)/2;
    build(p*2,l,md);build(p*2+1,md+1,r);
    seg[p].cnt = seg[p*2].cnt+seg[p*2+1].cnt;
    seg[p].sum = seg[p*2].sum+seg[p*2+1].sum;
}
void update(int p,int l,int r,int idx,long long val){
    if(l==r){
        seg[p].cnt+=val;
        seg[p].sum+=val*pref[l-1];
        return ;
    }
    int md = (l+r)/2;
    if(idx<=md)update(p*2,l,md,idx,val);
    else update(p*2+1,md+1,r,idx,val);
    seg[p].cnt = seg[p*2].cnt+seg[p*2+1].cnt;
    seg[p].sum = seg[p*2].sum+seg[p*2+1].sum;
}
long long query(int p,int l,int r,long long idx){
    if(l==r){
        return pref[l-1]*idx;
    }
    int md = (l+r)/2;
    if(seg[p*2+1].cnt<idx)return seg[p*2+1].sum+query(p*2,l,md,idx-seg[p*2+1].cnt);
    return query(p*2+1,md+1,r,idx);
}
int k;
long long inf = 1e18;
signed main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    long long n;
    cin>>n>>k;
    vector<pair<long long,long long>> v;
    for(int i = 0;i<n;i++){
        long long a,b;
        cin>>a>>b;
        pref.push_back(a);
        v.push_back({b,a});
    }
    sort(pref.begin(),pref.end());
    pref.erase(unique(pref.begin(),pref.end()),pref.end());
    sz = pref.size();sort(v.begin(),v.end());
    for(int i = 0;i<n;i++){
        v[i].second = lower_bound(pref.begin(),pref.end(),v[i].second)-pref.begin()+1;
    }
    build(1,1,sz);
    auto cost = [&](int l,int r){
        while(cl>l)update(1,1,sz,v[--cl].second,1);
        while(cr<r)update(1,1,sz,v[++cr].second,1);
        while(cl<l)update(1,1,sz,v[cl++].second,-1);
        while(cr>r)update(1,1,sz,v[cr--].second,-1);
        return query(1,1,sz,k)-2*(v[r].first-v[l].first);
    };
    int ans = -inf;
    function<void(int,int,int,int)> dnc = [&](int l,int r,int optl,int optr){
        if(l>r) return;
        int sum=0,mid=(l+r)>>1;
        pair<int,int> opt={-inf,-1};
        for(int i=min(optr,mid-k+1);i>=optl;i--){
            int res=cost(i,mid);ans=max(ans,res);
            opt=max(opt,{res,i});
        }
        dnc(l,mid-1,optl,opt.second);
        dnc(mid+1,r,opt.second,optr);
    };
    dnc(k-1,n-1,0,n-k);
    cout<<ans<<endl;
    return 0;
}

Compilation message

cake3.cpp: In lambda function:
cake3.cpp:71:13: warning: unused variable 'sum' [-Wunused-variable]
   71 |         int sum=0,mid=(l+r)>>1;
      |             ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 5 ms 12800 KB Output is correct
4 Correct 6 ms 12756 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 5 ms 12792 KB Output is correct
7 Correct 5 ms 12756 KB Output is correct
8 Correct 5 ms 12756 KB Output is correct
9 Correct 5 ms 12756 KB Output is correct
10 Correct 6 ms 12756 KB Output is correct
11 Correct 5 ms 12760 KB Output is correct
12 Correct 5 ms 12852 KB Output is correct
13 Correct 5 ms 12756 KB Output is correct
14 Correct 5 ms 12756 KB Output is correct
15 Correct 7 ms 12756 KB Output is correct
16 Correct 5 ms 12756 KB Output is correct
17 Correct 5 ms 12756 KB Output is correct
18 Correct 5 ms 12756 KB Output is correct
19 Correct 5 ms 12756 KB Output is correct
20 Correct 6 ms 12780 KB Output is correct
21 Correct 7 ms 12828 KB Output is correct
22 Correct 5 ms 12756 KB Output is correct
23 Correct 5 ms 12792 KB Output is correct
24 Correct 5 ms 12844 KB Output is correct
25 Correct 5 ms 12756 KB Output is correct
26 Correct 5 ms 12756 KB Output is correct
27 Correct 6 ms 12756 KB Output is correct
28 Correct 5 ms 12756 KB Output is correct
29 Correct 6 ms 12788 KB Output is correct
30 Correct 5 ms 12756 KB Output is correct
31 Correct 5 ms 12756 KB Output is correct
32 Correct 5 ms 12756 KB Output is correct
33 Correct 5 ms 12756 KB Output is correct
34 Correct 5 ms 12756 KB Output is correct
35 Correct 5 ms 12744 KB Output is correct
36 Correct 6 ms 12852 KB Output is correct
37 Correct 5 ms 12756 KB Output is correct
38 Correct 9 ms 12884 KB Output is correct
39 Correct 9 ms 12884 KB Output is correct
40 Correct 9 ms 13024 KB Output is correct
41 Correct 8 ms 12904 KB Output is correct
42 Correct 7 ms 12884 KB Output is correct
43 Correct 7 ms 12948 KB Output is correct
44 Correct 9 ms 12884 KB Output is correct
45 Correct 9 ms 12884 KB Output is correct
46 Correct 9 ms 12864 KB Output is correct
47 Correct 10 ms 12864 KB Output is correct
48 Correct 9 ms 12860 KB Output is correct
49 Correct 8 ms 12884 KB Output is correct
50 Correct 8 ms 12884 KB Output is correct
51 Correct 8 ms 12900 KB Output is correct
52 Correct 8 ms 12904 KB Output is correct
53 Correct 8 ms 12884 KB Output is correct
54 Correct 7 ms 12884 KB Output is correct
55 Correct 7 ms 12860 KB Output is correct
56 Correct 8 ms 12868 KB Output is correct
57 Correct 7 ms 12884 KB Output is correct
58 Correct 9 ms 13012 KB Output is correct
59 Correct 6 ms 12860 KB Output is correct
60 Correct 6 ms 12968 KB Output is correct
61 Correct 6 ms 12884 KB Output is correct
62 Correct 6 ms 12860 KB Output is correct
63 Correct 6 ms 12884 KB Output is correct
64 Correct 6 ms 12884 KB Output is correct
65 Correct 9 ms 12904 KB Output is correct
66 Correct 8 ms 12904 KB Output is correct
67 Correct 9 ms 12856 KB Output is correct
68 Correct 8 ms 12912 KB Output is correct
69 Correct 8 ms 12884 KB Output is correct
70 Correct 8 ms 12956 KB Output is correct
71 Correct 7 ms 12884 KB Output is correct
72 Correct 8 ms 12964 KB Output is correct
73 Correct 8 ms 12988 KB Output is correct
74 Correct 6 ms 12884 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 5 ms 12800 KB Output is correct
4 Correct 6 ms 12756 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 5 ms 12792 KB Output is correct
7 Correct 5 ms 12756 KB Output is correct
8 Correct 5 ms 12756 KB Output is correct
9 Correct 5 ms 12756 KB Output is correct
10 Correct 6 ms 12756 KB Output is correct
11 Correct 5 ms 12760 KB Output is correct
12 Correct 5 ms 12852 KB Output is correct
13 Correct 5 ms 12756 KB Output is correct
14 Correct 5 ms 12756 KB Output is correct
15 Correct 7 ms 12756 KB Output is correct
16 Correct 5 ms 12756 KB Output is correct
17 Correct 5 ms 12756 KB Output is correct
18 Correct 5 ms 12756 KB Output is correct
19 Correct 5 ms 12756 KB Output is correct
20 Correct 6 ms 12780 KB Output is correct
21 Correct 7 ms 12828 KB Output is correct
22 Correct 5 ms 12756 KB Output is correct
23 Correct 5 ms 12792 KB Output is correct
24 Correct 5 ms 12844 KB Output is correct
25 Correct 5 ms 12756 KB Output is correct
26 Correct 5 ms 12756 KB Output is correct
27 Correct 6 ms 12756 KB Output is correct
28 Correct 5 ms 12756 KB Output is correct
29 Correct 6 ms 12788 KB Output is correct
30 Correct 5 ms 12756 KB Output is correct
31 Correct 5 ms 12756 KB Output is correct
32 Correct 5 ms 12756 KB Output is correct
33 Correct 5 ms 12756 KB Output is correct
34 Correct 5 ms 12756 KB Output is correct
35 Correct 5 ms 12744 KB Output is correct
36 Correct 6 ms 12852 KB Output is correct
37 Correct 5 ms 12756 KB Output is correct
38 Correct 9 ms 12884 KB Output is correct
39 Correct 9 ms 12884 KB Output is correct
40 Correct 9 ms 13024 KB Output is correct
41 Correct 8 ms 12904 KB Output is correct
42 Correct 7 ms 12884 KB Output is correct
43 Correct 7 ms 12948 KB Output is correct
44 Correct 9 ms 12884 KB Output is correct
45 Correct 9 ms 12884 KB Output is correct
46 Correct 9 ms 12864 KB Output is correct
47 Correct 10 ms 12864 KB Output is correct
48 Correct 9 ms 12860 KB Output is correct
49 Correct 8 ms 12884 KB Output is correct
50 Correct 8 ms 12884 KB Output is correct
51 Correct 8 ms 12900 KB Output is correct
52 Correct 8 ms 12904 KB Output is correct
53 Correct 8 ms 12884 KB Output is correct
54 Correct 7 ms 12884 KB Output is correct
55 Correct 7 ms 12860 KB Output is correct
56 Correct 8 ms 12868 KB Output is correct
57 Correct 7 ms 12884 KB Output is correct
58 Correct 9 ms 13012 KB Output is correct
59 Correct 6 ms 12860 KB Output is correct
60 Correct 6 ms 12968 KB Output is correct
61 Correct 6 ms 12884 KB Output is correct
62 Correct 6 ms 12860 KB Output is correct
63 Correct 6 ms 12884 KB Output is correct
64 Correct 6 ms 12884 KB Output is correct
65 Correct 9 ms 12904 KB Output is correct
66 Correct 8 ms 12904 KB Output is correct
67 Correct 9 ms 12856 KB Output is correct
68 Correct 8 ms 12912 KB Output is correct
69 Correct 8 ms 12884 KB Output is correct
70 Correct 8 ms 12956 KB Output is correct
71 Correct 7 ms 12884 KB Output is correct
72 Correct 8 ms 12964 KB Output is correct
73 Correct 8 ms 12988 KB Output is correct
74 Correct 6 ms 12884 KB Output is correct
75 Correct 1093 ms 21036 KB Output is correct
76 Correct 1281 ms 20828 KB Output is correct
77 Correct 929 ms 21068 KB Output is correct
78 Correct 990 ms 21200 KB Output is correct
79 Correct 126 ms 21284 KB Output is correct
80 Correct 192 ms 20980 KB Output is correct
81 Correct 742 ms 20364 KB Output is correct
82 Correct 1006 ms 20472 KB Output is correct
83 Correct 886 ms 20704 KB Output is correct
84 Correct 943 ms 20688 KB Output is correct
85 Correct 749 ms 20408 KB Output is correct
86 Correct 364 ms 20364 KB Output is correct
87 Correct 398 ms 20348 KB Output is correct
88 Correct 671 ms 20304 KB Output is correct
89 Correct 649 ms 20392 KB Output is correct
90 Correct 378 ms 20728 KB Output is correct
91 Correct 248 ms 20288 KB Output is correct
92 Correct 271 ms 20312 KB Output is correct
93 Correct 304 ms 20364 KB Output is correct
94 Correct 210 ms 20648 KB Output is correct
95 Correct 365 ms 20704 KB Output is correct
96 Correct 62 ms 20288 KB Output is correct
97 Correct 63 ms 20620 KB Output is correct
98 Correct 82 ms 20464 KB Output is correct
99 Correct 75 ms 20564 KB Output is correct
100 Correct 66 ms 20356 KB Output is correct
101 Correct 56 ms 20332 KB Output is correct
102 Correct 488 ms 20272 KB Output is correct
103 Correct 468 ms 20292 KB Output is correct
104 Correct 582 ms 20488 KB Output is correct
105 Correct 370 ms 20368 KB Output is correct
106 Correct 381 ms 20604 KB Output is correct
107 Correct 323 ms 20340 KB Output is correct
108 Correct 910 ms 20968 KB Output is correct
109 Correct 673 ms 21532 KB Output is correct
110 Correct 108 ms 19972 KB Output is correct
111 Correct 144 ms 19908 KB Output is correct
112 Correct 378 ms 19860 KB Output is correct
113 Correct 127 ms 21632 KB Output is correct