oj.uz

답안 #129049

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129049 2019-07-11T13:21:34 Z Plurm Cake 3 (JOI19_cake3) C++11
100 / 100
 1169 ms 116676 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m;
vector<pair<int,int> > pieces;
const int COEFF = 32;
const int MXN = 200005;
int segT[COEFF*MXN];
long long qs[MXN];
long long qsegT[COEFF*MXN];
int lb[COEFF*MXN];
int rb[COEFF*MXN];
int llink[COEFF*MXN];
int rlink[COEFF*MXN];
int nodesz;
inline int newnode(int o = -1){
    int c = ++nodesz;
    if(o != -1){
        qsegT[c] = qsegT[o];
        segT[c] = segT[o];
        lb[c] = lb[o];
        rb[c] = rb[o];
        llink[c] = llink[o];
        rlink[c] = rlink[o];
    }
    return c;
}
int build(int l, int r){
    int c = newnode();
    lb[c] = l;
    rb[c] = r;
    if(l == r) return c;
    int k = (l + r)/2;
    llink[c] = build(l, k);
    rlink[c] = build(k+1, r);
    return c;
}
int update(int o, int idx, int amt){
    int c = newnode(o);
    if(lb[c] == rb[c]){
        segT[c] = 1;
        qsegT[c] = amt;
        return c;
    }
    int k = (lb[c] + rb[c])/2;
    if(idx <= k){
        llink[c] = update(llink[o], idx, amt);
    }else{
        rlink[c] = update(rlink[o], idx, amt);
    }
    segT[c] = segT[llink[c]] + segT[rlink[c]];
    qsegT[c] = qsegT[llink[c]] + qsegT[rlink[c]];
    return c;
}
long long sumdescent(int c, int o, int ord){
    if(ord == 0) return 0ll;
    if(ord == segT[c] - segT[o]) return qsegT[c] - qsegT[o];
    if(lb[c] == rb[c]) return qsegT[c] - qsegT[o];
    int lcnt = segT[llink[c]] - segT[llink[o]];
    if(lcnt >= ord) return sumdescent(llink[c], llink[o], ord);
    else return sumdescent(rlink[c], rlink[o], ord - lcnt) + qsegT[llink[c]] - qsegT[llink[o]];
}
vector<int> rootlist;
long long query(int l, int r){
    int croot = rootlist[r];
    int items = r-l+1 - (m-2);
    long long qr = sumdescent(rootlist[r], rootlist[l-1], items);
    long long rsq = qs[r] - qs[l-1];
    return rsq - qr;
}
long long solve(int l, int r, int lb, int rb){
    int mid = (l + r)/2;
    long long ans = -1e18;
    int mindex = -1;
    for(int i = lb; i <= min(mid-m+1,rb); i++){
        long long cur = query(i+1, mid-1) + 1ll * pieces[i].first + 1ll * pieces[mid].first + 2ll * pieces[i].second - 2ll * pieces[mid].second;
        if(cur > ans){
            ans = cur;
            mindex = i;
        }
    }
    if(l <= mid-1) ans = max(ans, solve(l, mid-1, lb, mindex == -1 ? rb : mindex));
    if(mid+1 <= r) ans = max(ans, solve(mid+1, r, mindex == -1 ? lb : mindex, rb));
    return ans;
}
int mp[MXN];
int main(){
    scanf("%d%d",&n,&m);
    int v,c;
    vector<pair<int,int> > rankofv;
    for(int i = 0; i < n; i++){
        scanf("%d%d",&v,&c);
        pieces.emplace_back(v,c);
    }
    stable_sort(pieces.begin(), pieces.end(), [](pair<int,int> x, pair<int,int> y){
        return x.second < y.second;
    });
    for(int i = 0; i < n; i++){
        rankofv.emplace_back(pieces[i].first,i);
    }
    sort(rankofv.begin(), rankofv.end());
    for(int i = 0; i < rankofv.size(); i++){
        mp[rankofv[i].second] = i;
    }
    qs[0] = pieces[0].first;
    for(int i = 1; i < n; i++){
        qs[i] = qs[i-1] + 1ll * pieces[i].first;
    }
    int initroot = build(0,n-1);
    int lastroot = initroot;
    for(int i = 0; i < n; i++){
        int idx = mp[i];
        //printf("DBG %d %d %lld\n",idx,pieces[i].first,qsegT[lastroot]);
        rootlist.push_back(update(lastroot, idx, pieces[i].first));
        lastroot = rootlist.back();
    }
    long long ans = solve(m-1,n-1,0,n-1);
    printf("%lld\n",ans);
    return 0;
}

Compilation message

cake3.cpp: In function 'long long int query(int, int)':
cake3.cpp:64:9: warning: unused variable 'croot' [-Wunused-variable]
     int croot = rootlist[r];
         ^~~~~
cake3.cpp: In function 'int main()':
cake3.cpp:101:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < rankofv.size(); i++){
                    ~~^~~~~~~~~~~~~~~~
cake3.cpp:87:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
cake3.cpp:91:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&v,&c);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 424 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 420 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 5 ms 1144 KB Output is correct
39 Correct 5 ms 1144 KB Output is correct
40 Correct 5 ms 1144 KB Output is correct
41 Correct 5 ms 1144 KB Output is correct
42 Correct 4 ms 1144 KB Output is correct
43 Correct 4 ms 1016 KB Output is correct
44 Correct 5 ms 1016 KB Output is correct
45 Correct 5 ms 1148 KB Output is correct
46 Correct 5 ms 1144 KB Output is correct
47 Correct 5 ms 1144 KB Output is correct
48 Correct 5 ms 1016 KB Output is correct
49 Correct 5 ms 1116 KB Output is correct
50 Correct 5 ms 1144 KB Output is correct
51 Correct 5 ms 1144 KB Output is correct
52 Correct 4 ms 1144 KB Output is correct
53 Correct 5 ms 1144 KB Output is correct
54 Correct 4 ms 1144 KB Output is correct
55 Correct 4 ms 1144 KB Output is correct
56 Correct 4 ms 1144 KB Output is correct
57 Correct 4 ms 1144 KB Output is correct
58 Correct 4 ms 1144 KB Output is correct
59 Correct 5 ms 1144 KB Output is correct
60 Correct 4 ms 1144 KB Output is correct
61 Correct 5 ms 1144 KB Output is correct
62 Correct 5 ms 1144 KB Output is correct
63 Correct 4 ms 1144 KB Output is correct
64 Correct 4 ms 1144 KB Output is correct
65 Correct 5 ms 1144 KB Output is correct
66 Correct 5 ms 1144 KB Output is correct
67 Correct 5 ms 1144 KB Output is correct
68 Correct 5 ms 1144 KB Output is correct
69 Correct 5 ms 1144 KB Output is correct
70 Correct 4 ms 1144 KB Output is correct
71 Correct 4 ms 1144 KB Output is correct
72 Correct 4 ms 1144 KB Output is correct
73 Correct 5 ms 1144 KB Output is correct
74 Correct 4 ms 1144 KB Output is correct
75 Correct 1113 ms 108280 KB Output is correct
76 Correct 1169 ms 105176 KB Output is correct
77 Correct 1018 ms 108592 KB Output is correct
78 Correct 1078 ms 110312 KB Output is correct
79 Correct 415 ms 110608 KB Output is correct
80 Correct 441 ms 107456 KB Output is correct
81 Correct 889 ms 109568 KB Output is correct
82 Correct 1092 ms 111344 KB Output is correct
83 Correct 1088 ms 114924 KB Output is correct
84 Correct 1066 ms 114600 KB Output is correct
85 Correct 916 ms 110608 KB Output is correct
86 Correct 526 ms 106608 KB Output is correct
87 Correct 565 ms 105376 KB Output is correct
88 Correct 816 ms 104540 KB Output is correct
89 Correct 798 ms 110736 KB Output is correct
90 Correct 573 ms 116128 KB Output is correct
91 Correct 451 ms 106888 KB Output is correct
92 Correct 449 ms 106060 KB Output is correct
93 Correct 504 ms 110808 KB Output is correct
94 Correct 457 ms 115920 KB Output is correct
95 Correct 554 ms 115968 KB Output is correct
96 Correct 395 ms 107448 KB Output is correct
97 Correct 444 ms 116500 KB Output is correct
98 Correct 438 ms 114548 KB Output is correct
99 Correct 407 ms 114784 KB Output is correct
100 Correct 357 ms 107956 KB Output is correct
101 Correct 361 ms 108084 KB Output is correct
102 Correct 940 ms 108208 KB Output is correct
103 Correct 775 ms 106440 KB Output is correct
104 Correct 970 ms 112632 KB Output is correct
105 Correct 674 ms 112084 KB Output is correct
106 Correct 748 ms 115168 KB Output is correct
107 Correct 643 ms 110992 KB Output is correct
108 Correct 1018 ms 109868 KB Output is correct
109 Correct 892 ms 116676 KB Output is correct
110 Correct 342 ms 108840 KB Output is correct
111 Correct 429 ms 110080 KB Output is correct
112 Correct 1054 ms 104796 KB Output is correct
113 Correct 437 ms 116676 KB Output is correct