Submission #931968

# Submission time Handle Problem Language Result Execution time Memory
931968 2024-02-22T16:45:31 Z velislavgarkov Cake 3 (JOI19_cake3) C++14
100 / 100
426 ms 17468 KB
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=2e5+10;
const long long INF=1e15;
struct Cake {
    long long v;
    long long c;
    int ind;
};
bool cmpc(Cake a, Cake b) {
    return a.c<b.c;
}
bool cmpv(Cake a, Cake b) {
    return a.v>b.v;
}
struct Node {
    int br;
    long long sum;
};
Cake a[MAXN], b[MAXN];
Node fen[MAXN];
int um[MAXN];
int n, m, max_st;
int curl, curr;
long long ans;
void update(int ind, int ch) {
    if (ind==0) return;
    ind=um[ind];
    long long pl;
    if (ch==1) pl=b[ind].v;
    else pl=-b[ind].v;
    while (ind<=n) {
        fen[ind].br+=ch;
        fen[ind].sum+=pl;
        ind+=(ind & (-ind));
    }
}
long long query(int ind) {
    long long res=0;
    while (ind>0) {
        res+=fen[ind].sum;
        ind-=(ind & (-ind));
    }
    return res;
}
long long findm(int k) {
    int st, ind;
    ind=max_st;
    st=(max_st>>1);
    while (st>0 && fen[ind].br!=k) {
        if (fen[ind].br>k) ind-=st;
        else {
            k-=fen[ind].br;
            while (ind+st>n) st=(st>>1);
            ind+=st;
        }
        st=(st>>1);
    }
    return query(ind);
}
void move_next(int nextl, int nextr) {
    while (curl>nextl) {
        update(curl-1,1);
        curl--;
    }
    while (curr<nextr) {
        update(curr+1,1);
        curr++;
    }
    while (curl<nextl) {
        update(curl,-1);
        curl++;
    }
    while (curr>nextr) {
        update(curr,-1);
        curr--;
    }
}
void dc(int l, int r, int opl, int opr) {
    if (l>r) return;
    int mid=(l+r)/2;
    int start=max(mid+m-1,opl), best=-1;
    long long res=-INF;
    move_next(mid+1,start-1);
    for (int i=start;i<=opr;i++) {
        long long s=findm(m-2)+a[mid].v+a[i].v-2ll*(a[i].c-a[mid].c);
        //cout << mid << ' ' << i << ' ' << s << ' ' << findm(m-2) << ' ' << a[mid].v+a[i].v << ' ' << 2*(a[i].c-a[mid].c) << endl;
        if (s>res) {
            res=s;
            best=i;
        }
        update(curr+1,1);
        curr++;
    }
    //cout << mid << ' ' << res << ' ' << best << ' ' << opl << ' ' << opr << endl;
    ans=max(ans,res);
    if (best==-1) return;
    dc(l,mid-1,opl,best);
    dc(mid+1,r,best,opr);
}
int main () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m;
    for (int i=1;i<=n;i++) cin >> a[i].v >> a[i].c;
    sort(a+1,a+n+1,cmpc);
    for (int i=1;i<=n;i++) {
        b[i]=a[i];
        b[i].ind=i;
    }
    sort(b+1,b+n+1,cmpv);
    for (int i=1;i<=n;i++) um[b[i].ind]=i;
    curl=curr=0;
    max_st=1;
    while (max_st<=n) max_st=(max_st<<1);
    max_st=(max_st>>1);
    ans=-INF;
    dc(1,n-m+1,1,n);
    cout << ans << endl;
    return 0;
}
/*
8 4
112103441 501365808
659752417 137957977
86280801 257419447
902409188 565237611
965602301 689654312
104535476 646977261
945132881 114821749
198700181 915994879
5 3
2 1
2 2
6 4
8 8
10 16
*/
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6592 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6536 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6608 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6612 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 4 ms 6488 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6488 KB Output is correct
24 Correct 1 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 2 ms 6624 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6488 KB Output is correct
31 Correct 1 ms 6496 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6608 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6592 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6536 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6608 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6612 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 4 ms 6488 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6488 KB Output is correct
24 Correct 1 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 2 ms 6624 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6488 KB Output is correct
31 Correct 1 ms 6496 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6608 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 3 ms 6492 KB Output is correct
39 Correct 3 ms 6492 KB Output is correct
40 Correct 3 ms 6488 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 3 ms 6656 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 3 ms 6492 KB Output is correct
45 Correct 3 ms 6492 KB Output is correct
46 Correct 3 ms 6648 KB Output is correct
47 Correct 3 ms 6488 KB Output is correct
48 Correct 3 ms 6496 KB Output is correct
49 Correct 2 ms 6492 KB Output is correct
50 Correct 2 ms 6492 KB Output is correct
51 Correct 2 ms 6692 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Correct 2 ms 6492 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 2 ms 6492 KB Output is correct
58 Correct 2 ms 6616 KB Output is correct
59 Correct 2 ms 6492 KB Output is correct
60 Correct 3 ms 6492 KB Output is correct
61 Correct 2 ms 6492 KB Output is correct
62 Correct 2 ms 6492 KB Output is correct
63 Correct 2 ms 6492 KB Output is correct
64 Correct 2 ms 6492 KB Output is correct
65 Correct 3 ms 6492 KB Output is correct
66 Correct 3 ms 6492 KB Output is correct
67 Correct 3 ms 6492 KB Output is correct
68 Correct 2 ms 6492 KB Output is correct
69 Correct 3 ms 6492 KB Output is correct
70 Correct 2 ms 6488 KB Output is correct
71 Correct 2 ms 6492 KB Output is correct
72 Correct 2 ms 6492 KB Output is correct
73 Correct 3 ms 6620 KB Output is correct
74 Correct 1 ms 6492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6592 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6536 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6608 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6612 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 4 ms 6488 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6488 KB Output is correct
24 Correct 1 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 2 ms 6624 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6488 KB Output is correct
31 Correct 1 ms 6496 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6608 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 3 ms 6492 KB Output is correct
39 Correct 3 ms 6492 KB Output is correct
40 Correct 3 ms 6488 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 3 ms 6656 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 3 ms 6492 KB Output is correct
45 Correct 3 ms 6492 KB Output is correct
46 Correct 3 ms 6648 KB Output is correct
47 Correct 3 ms 6488 KB Output is correct
48 Correct 3 ms 6496 KB Output is correct
49 Correct 2 ms 6492 KB Output is correct
50 Correct 2 ms 6492 KB Output is correct
51 Correct 2 ms 6692 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Correct 2 ms 6492 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 2 ms 6492 KB Output is correct
58 Correct 2 ms 6616 KB Output is correct
59 Correct 2 ms 6492 KB Output is correct
60 Correct 3 ms 6492 KB Output is correct
61 Correct 2 ms 6492 KB Output is correct
62 Correct 2 ms 6492 KB Output is correct
63 Correct 2 ms 6492 KB Output is correct
64 Correct 2 ms 6492 KB Output is correct
65 Correct 3 ms 6492 KB Output is correct
66 Correct 3 ms 6492 KB Output is correct
67 Correct 3 ms 6492 KB Output is correct
68 Correct 2 ms 6492 KB Output is correct
69 Correct 3 ms 6492 KB Output is correct
70 Correct 2 ms 6488 KB Output is correct
71 Correct 2 ms 6492 KB Output is correct
72 Correct 2 ms 6492 KB Output is correct
73 Correct 3 ms 6620 KB Output is correct
74 Correct 1 ms 6492 KB Output is correct
75 Correct 337 ms 16832 KB Output is correct
76 Correct 423 ms 17156 KB Output is correct
77 Correct 294 ms 16980 KB Output is correct
78 Correct 323 ms 16984 KB Output is correct
79 Correct 79 ms 16976 KB Output is correct
80 Correct 98 ms 16724 KB Output is correct
81 Correct 341 ms 16576 KB Output is correct
82 Correct 422 ms 16460 KB Output is correct
83 Correct 374 ms 16464 KB Output is correct
84 Correct 426 ms 16740 KB Output is correct
85 Correct 325 ms 16172 KB Output is correct
86 Correct 193 ms 15956 KB Output is correct
87 Correct 216 ms 15952 KB Output is correct
88 Correct 296 ms 16016 KB Output is correct
89 Correct 286 ms 16464 KB Output is correct
90 Correct 202 ms 16496 KB Output is correct
91 Correct 140 ms 15952 KB Output is correct
92 Correct 155 ms 16208 KB Output is correct
93 Correct 175 ms 16208 KB Output is correct
94 Correct 131 ms 16464 KB Output is correct
95 Correct 195 ms 16692 KB Output is correct
96 Correct 178 ms 15928 KB Output is correct
97 Correct 194 ms 16488 KB Output is correct
98 Correct 202 ms 16328 KB Output is correct
99 Correct 178 ms 16580 KB Output is correct
100 Correct 157 ms 16152 KB Output is correct
101 Correct 155 ms 15956 KB Output is correct
102 Correct 332 ms 15976 KB Output is correct
103 Correct 303 ms 15936 KB Output is correct
104 Correct 357 ms 16192 KB Output is correct
105 Correct 281 ms 16312 KB Output is correct
106 Correct 281 ms 16836 KB Output is correct
107 Correct 233 ms 16212 KB Output is correct
108 Correct 295 ms 16780 KB Output is correct
109 Correct 237 ms 17344 KB Output is correct
110 Correct 168 ms 15644 KB Output is correct
111 Correct 241 ms 15956 KB Output is correct
112 Correct 304 ms 15640 KB Output is correct
113 Correct 83 ms 17468 KB Output is correct