oj.uz

Submission #406039

# Submission time Handle Problem Language Result Execution time Memory
406039 2021-05-17T06:58:09 Z ansol4328 Cake 3 (JOI19_cake3) C++14
100 / 100
 956 ms 91868 KB 
#include<bits/stdc++.h>
#define rs resize

using namespace std;
typedef long long ll;

struct A{
    int x, y, v;
};

bool cmp1(const A &lhs, const A &rhs){
    return lhs.x<rhs.x;
}

bool cmp2(const A &lhs, const A &rhs){
    return lhs.v>rhs.v;
}

struct PST{
    vector<int> cnt, left, right, root;
    vector<ll> sum;
    int base, t;
    PST(int w, int rt, int up){
        int h=1; base=t=1;
        while(base<w) base<<=1, h++;
        int x=base*2+up*h+5;
        cnt.rs(x); sum.rs(x);
        left.rs(x); right.rs(x);
        root.rs(rt+5);
        root[0]=setUp(1,base);
    }
    int setUp(int l, int r){
        int cur=t++;
        if(l<r){
            int mid=(l+r)>>1;
            left[cur]=setUp(l,mid);
            right[cur]=setUp(mid+1,r);
        }
        return cur;
    }
    void updateKthTree(int k, int idx, int val){
        if(!root[k]) root[k]=root[k-1];
        root[k]=addNode(root[k],idx,val,1,base);
    }
    int addNode(int prev, int idx, int val, int l, int r){
        if(r<idx || idx<l) return prev;
        int cur=t++;
        if(l==r) cnt[cur]=1, sum[cur]=val;
        else{
            int mid=(l+r)>>1;
            left[cur]=addNode(left[prev],idx,val,l,mid);
            right[cur]=addNode(right[prev],idx,val,mid+1,r);
            l=left[cur], r=right[cur];
            sum[cur]=sum[l]+sum[r];
            cnt[cur]=cnt[l]+cnt[r];
        }
        return cur;
    }
    ll qry(int i1, int i2, int k){
        return qry(root[i1],root[i2],k,1,base);
    }
    ll qry(int i1, int i2, int k, int l, int r){
        if(k<=0) return 0LL;
        if(cnt[i1]-cnt[i2]<=k) return sum[i1]-sum[i2];
        int mid=(l+r)>>1;
        int x=cnt[left[i1]]-cnt[left[i2]];
        return qry(left[i1],left[i2],k,l,mid)+qry(right[i1],right[i2],k-x,mid+1,r);
    }
};

int N, M;
A VC[200005];
PST *pst;
ll ans;
const ll INF=1e18;

void solve(int l, int r, int optl, int optr)
{
    if(l>r) return;
    int j=(l+r)>>1, opt=optl; ll v=-INF;
    for(int i=max(optl,j+M-1) ; i<=optr ; i++){
        ll val=pst->qry(i,j-1,M)-2LL*(VC[i].x-VC[j].x);
        if(v<val) v=val, opt=i;
    }
    ans=max(ans,v);
    solve(l,j-1,optl,opt);
    solve(j+1,r,opt,optr);
}

int main()
{
    scanf("%d %d",&N,&M);
    for(int i=1 ; i<=N ; i++){
        scanf("%d %d",&VC[i].v,&VC[i].x);
    }
    sort(VC+1,VC+1+N,cmp2);
    for(int i=1 ; i<=N ; i++) VC[i].y=i;
    sort(VC+1,VC+1+N,cmp1);
    
    ans=-INF;
    pst=new PST(N,N,N);
    for(int i=1 ; i<=N ; i++) pst->updateKthTree(i,VC[i].y,VC[i].v);
    solve(1,N-M+1,1,N);
    delete pst;
    printf("%lld",ans);
    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:92:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
cake3.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         scanf("%d %d",&VC[i].v,&VC[i].x);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 4 ms 832 KB Output is correct
39 Correct 4 ms 844 KB Output is correct
40 Correct 3 ms 844 KB Output is correct
41 Correct 3 ms 844 KB Output is correct
42 Correct 3 ms 844 KB Output is correct
43 Correct 3 ms 844 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 4 ms 844 KB Output is correct
46 Correct 4 ms 844 KB Output is correct
47 Correct 4 ms 844 KB Output is correct
48 Correct 4 ms 844 KB Output is correct
49 Correct 3 ms 844 KB Output is correct
50 Correct 4 ms 844 KB Output is correct
51 Correct 3 ms 844 KB Output is correct
52 Correct 3 ms 844 KB Output is correct
53 Correct 3 ms 844 KB Output is correct
54 Correct 3 ms 828 KB Output is correct
55 Correct 3 ms 824 KB Output is correct
56 Correct 3 ms 844 KB Output is correct
57 Correct 3 ms 844 KB Output is correct
58 Correct 3 ms 844 KB Output is correct
59 Correct 3 ms 844 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 3 ms 844 KB Output is correct
62 Correct 3 ms 844 KB Output is correct
63 Correct 3 ms 832 KB Output is correct
64 Correct 3 ms 844 KB Output is correct
65 Correct 4 ms 844 KB Output is correct
66 Correct 4 ms 844 KB Output is correct
67 Correct 4 ms 844 KB Output is correct
68 Correct 3 ms 844 KB Output is correct
69 Correct 3 ms 844 KB Output is correct
70 Correct 3 ms 844 KB Output is correct
71 Correct 3 ms 844 KB Output is correct
72 Correct 3 ms 824 KB Output is correct
73 Correct 4 ms 844 KB Output is correct
74 Correct 2 ms 844 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 4 ms 832 KB Output is correct
39 Correct 4 ms 844 KB Output is correct
40 Correct 3 ms 844 KB Output is correct
41 Correct 3 ms 844 KB Output is correct
42 Correct 3 ms 844 KB Output is correct
43 Correct 3 ms 844 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 4 ms 844 KB Output is correct
46 Correct 4 ms 844 KB Output is correct
47 Correct 4 ms 844 KB Output is correct
48 Correct 4 ms 844 KB Output is correct
49 Correct 3 ms 844 KB Output is correct
50 Correct 4 ms 844 KB Output is correct
51 Correct 3 ms 844 KB Output is correct
52 Correct 3 ms 844 KB Output is correct
53 Correct 3 ms 844 KB Output is correct
54 Correct 3 ms 828 KB Output is correct
55 Correct 3 ms 824 KB Output is correct
56 Correct 3 ms 844 KB Output is correct
57 Correct 3 ms 844 KB Output is correct
58 Correct 3 ms 844 KB Output is correct
59 Correct 3 ms 844 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 3 ms 844 KB Output is correct
62 Correct 3 ms 844 KB Output is correct
63 Correct 3 ms 832 KB Output is correct
64 Correct 3 ms 844 KB Output is correct
65 Correct 4 ms 844 KB Output is correct
66 Correct 4 ms 844 KB Output is correct
67 Correct 4 ms 844 KB Output is correct
68 Correct 3 ms 844 KB Output is correct
69 Correct 3 ms 844 KB Output is correct
70 Correct 3 ms 844 KB Output is correct
71 Correct 3 ms 844 KB Output is correct
72 Correct 3 ms 824 KB Output is correct
73 Correct 4 ms 844 KB Output is correct
74 Correct 2 ms 844 KB Output is correct
75 Correct 869 ms 86352 KB Output is correct
76 Correct 914 ms 84292 KB Output is correct
77 Correct 811 ms 86532 KB Output is correct
78 Correct 867 ms 87780 KB Output is correct
79 Correct 315 ms 87928 KB Output is correct
80 Correct 364 ms 85740 KB Output is correct
81 Correct 796 ms 86468 KB Output is correct
82 Correct 956 ms 87576 KB Output is correct
83 Correct 927 ms 90052 KB Output is correct
84 Correct 924 ms 89744 KB Output is correct
85 Correct 856 ms 87052 KB Output is correct
86 Correct 527 ms 84416 KB Output is correct
87 Correct 576 ms 83524 KB Output is correct
88 Correct 777 ms 83012 KB Output is correct
89 Correct 756 ms 87084 KB Output is correct
90 Correct 546 ms 90552 KB Output is correct
91 Correct 421 ms 84568 KB Output is correct
92 Correct 413 ms 83916 KB Output is correct
93 Correct 497 ms 87132 KB Output is correct
94 Correct 415 ms 90440 KB Output is correct
95 Correct 532 ms 90640 KB Output is correct
96 Correct 527 ms 84908 KB Output is correct
97 Correct 532 ms 90776 KB Output is correct
98 Correct 588 ms 89616 KB Output is correct
99 Correct 509 ms 89668 KB Output is correct
100 Correct 427 ms 85144 KB Output is correct
101 Correct 443 ms 85284 KB Output is correct
102 Correct 761 ms 85316 KB Output is correct
103 Correct 749 ms 84272 KB Output is correct
104 Correct 822 ms 88316 KB Output is correct
105 Correct 712 ms 88040 KB Output is correct
106 Correct 733 ms 90064 KB Output is correct
107 Correct 644 ms 87364 KB Output is correct
108 Correct 845 ms 87156 KB Output is correct
109 Correct 719 ms 91688 KB Output is correct
110 Correct 409 ms 85188 KB Output is correct
111 Correct 515 ms 86144 KB Output is correct
112 Correct 707 ms 82612 KB Output is correct
113 Correct 362 ms 91868 KB Output is correct