oj.uz

답안 #163658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
163658 2019-11-14T13:47:18 Z georgerapeanu Cake 3 (JOI19_cake3) C++11
100 / 100
 3292 ms 19060 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

const int NMAX = 2e5;

int n,m;
pair<int,int> v[NMAX + 5];

vector<int> vals;

map<int,int> stuff;

pair<long long,int> aib[NMAX + 5];

void update(int pos,pair<int,int> val) {
    pos = (int)vals.size() - pos + 1;///for enhanced binary searche
    for(; pos <= (int)vals.size(); pos += (-pos) & pos) {
        aib[pos].first += val.first;
        aib[pos].second += val.second;
    }
}

long long get_best_sum(int cnt) {
    pair<long long,int> lst = {0,0};
    int pos = 0;

    for(int h = 1 << 18; h; h >>= 1) {
        if(pos + h <= (int)vals.size() && lst.second + aib[pos + h].second < cnt) {
            pos += h;
            lst.first += aib[pos].first;
            lst.second += aib[pos].second;
        }
    }
    lst.first += 1LL * (cnt - lst.second) * vals[(int)vals.size() - pos - 1];
    return lst.first;
}

int ins_cnt;

void add(pair<int,int> a) {
    ins_cnt++;
    stuff[a.second]++;
    update(lower_bound(vals.begin(),vals.end(),a.first) - vals.begin() + 1, {a.first,1});
}

void rem(pair<int,int> a) {
    ins_cnt--;
    stuff[a.second]--;
    if(stuff[a.second] == 0){
        stuff.erase(a.second);
    }
    update(lower_bound(vals.begin(),vals.end(),a.first) - vals.begin() + 1, {-a.first,-1});
}

long long query(int cnt) {
    if(cnt > ins_cnt) {
        return -1e18;
    }
    long long ans = -stuff.rbegin()->first + stuff.begin()->first + get_best_sum(cnt);
    return ans;
}

int st = 1,dr = 0;
long long calc(int l,int r) {
    while(st > l) {
        add(v[--st]);
    }
    while(dr < r) {
        add(v[++dr]);
    }
    while(st < l) {
        rem(v[st++]);
    }
    while(dr > r) {
        rem(v[dr--]);
    }
    return query(m);
}

long long solve(int st,int dr,int lo,int hi) {

    if(st > dr) {
        return -1e18;
    }

    int mid = (st + dr) / 2;
    pair<long long,int> bst = {-1e18,0};
    for(int i = max(lo,mid); i <= hi; i++) {
        bst = max(bst, {calc(mid,i),i});
    }

    if(st == dr) {
        return bst.first;
    }

    return max(max(solve(st,mid - 1,lo,bst.second),solve(mid + 1,dr,bst.second,hi)),bst.first);
}

int main() {

    scanf("%d %d",&n,&m);

    for(int i = 1; i <= n; i++) {
        scanf("%d %d",&v[i].first,&v[i].second);
        v[i].second *= 2;
        vals.push_back(v[i].first);
    }

    sort(vals.begin(),vals.end());
    vals.resize(unique(vals.begin(),vals.end()) - vals.begin());

    sort(v + 1,v + 1 + n,[&]
    (const pair<int,int> &a,const pair<int,int> &b) {
        if(a.second != b.second) {
            return a.second < b.second;
        }
        return a.first < b.first;
    });

    printf("%lld\n",solve(1,n - m + 1,m,n));


    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:105: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:108:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&v[i].first,&v[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 3 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 256 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 376 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 360 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 252 KB Output is correct
30 Correct 2 ms 256 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 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 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 380 KB Output is correct
2 Correct 3 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 256 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 376 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 360 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 252 KB Output is correct
30 Correct 2 ms 256 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 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 11 ms 504 KB Output is correct
39 Correct 11 ms 632 KB Output is correct
40 Correct 8 ms 632 KB Output is correct
41 Correct 8 ms 504 KB Output is correct
42 Correct 6 ms 504 KB Output is correct
43 Correct 7 ms 504 KB Output is correct
44 Correct 10 ms 528 KB Output is correct
45 Correct 11 ms 504 KB Output is correct
46 Correct 12 ms 504 KB Output is correct
47 Correct 12 ms 508 KB Output is correct
48 Correct 11 ms 376 KB Output is correct
49 Correct 9 ms 508 KB Output is correct
50 Correct 10 ms 504 KB Output is correct
51 Correct 9 ms 504 KB Output is correct
52 Correct 8 ms 504 KB Output is correct
53 Correct 9 ms 504 KB Output is correct
54 Correct 7 ms 504 KB Output is correct
55 Correct 6 ms 504 KB Output is correct
56 Correct 6 ms 504 KB Output is correct
57 Correct 6 ms 504 KB Output is correct
58 Correct 6 ms 504 KB Output is correct
59 Correct 4 ms 376 KB Output is correct
60 Correct 4 ms 376 KB Output is correct
61 Correct 4 ms 376 KB Output is correct
62 Correct 4 ms 376 KB Output is correct
63 Correct 3 ms 376 KB Output is correct
64 Correct 3 ms 376 KB Output is correct
65 Correct 10 ms 504 KB Output is correct
66 Correct 10 ms 504 KB Output is correct
67 Correct 10 ms 376 KB Output is correct
68 Correct 9 ms 504 KB Output is correct
69 Correct 8 ms 376 KB Output is correct
70 Correct 9 ms 504 KB Output is correct
71 Correct 8 ms 376 KB Output is correct
72 Correct 6 ms 380 KB Output is correct
73 Correct 6 ms 376 KB Output is correct
74 Correct 4 ms 504 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 3 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 256 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 376 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 360 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 252 KB Output is correct
30 Correct 2 ms 256 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 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 11 ms 504 KB Output is correct
39 Correct 11 ms 632 KB Output is correct
40 Correct 8 ms 632 KB Output is correct
41 Correct 8 ms 504 KB Output is correct
42 Correct 6 ms 504 KB Output is correct
43 Correct 7 ms 504 KB Output is correct
44 Correct 10 ms 528 KB Output is correct
45 Correct 11 ms 504 KB Output is correct
46 Correct 12 ms 504 KB Output is correct
47 Correct 12 ms 508 KB Output is correct
48 Correct 11 ms 376 KB Output is correct
49 Correct 9 ms 508 KB Output is correct
50 Correct 10 ms 504 KB Output is correct
51 Correct 9 ms 504 KB Output is correct
52 Correct 8 ms 504 KB Output is correct
53 Correct 9 ms 504 KB Output is correct
54 Correct 7 ms 504 KB Output is correct
55 Correct 6 ms 504 KB Output is correct
56 Correct 6 ms 504 KB Output is correct
57 Correct 6 ms 504 KB Output is correct
58 Correct 6 ms 504 KB Output is correct
59 Correct 4 ms 376 KB Output is correct
60 Correct 4 ms 376 KB Output is correct
61 Correct 4 ms 376 KB Output is correct
62 Correct 4 ms 376 KB Output is correct
63 Correct 3 ms 376 KB Output is correct
64 Correct 3 ms 376 KB Output is correct
65 Correct 10 ms 504 KB Output is correct
66 Correct 10 ms 504 KB Output is correct
67 Correct 10 ms 376 KB Output is correct
68 Correct 9 ms 504 KB Output is correct
69 Correct 8 ms 376 KB Output is correct
70 Correct 9 ms 504 KB Output is correct
71 Correct 8 ms 376 KB Output is correct
72 Correct 6 ms 380 KB Output is correct
73 Correct 6 ms 376 KB Output is correct
74 Correct 4 ms 504 KB Output is correct
75 Correct 2707 ms 17908 KB Output is correct
76 Correct 3292 ms 17584 KB Output is correct
77 Correct 2289 ms 18100 KB Output is correct
78 Correct 2516 ms 18160 KB Output is correct
79 Correct 229 ms 18296 KB Output is correct
80 Correct 444 ms 17884 KB Output is correct
81 Correct 2144 ms 12140 KB Output is correct
82 Correct 2463 ms 11796 KB Output is correct
83 Correct 2311 ms 12384 KB Output is correct
84 Correct 2405 ms 12136 KB Output is correct
85 Correct 2019 ms 12008 KB Output is correct
86 Correct 1457 ms 12352 KB Output is correct
87 Correct 1383 ms 12004 KB Output is correct
88 Correct 1808 ms 11732 KB Output is correct
89 Correct 1707 ms 12392 KB Output is correct
90 Correct 1464 ms 13384 KB Output is correct
91 Correct 867 ms 12904 KB Output is correct
92 Correct 982 ms 12776 KB Output is correct
93 Correct 1179 ms 13132 KB Output is correct
94 Correct 720 ms 14312 KB Output is correct
95 Correct 1415 ms 13400 KB Output is correct
96 Correct 204 ms 5352 KB Output is correct
97 Correct 215 ms 5740 KB Output is correct
98 Correct 225 ms 5624 KB Output is correct
99 Correct 208 ms 5636 KB Output is correct
100 Correct 180 ms 5356 KB Output is correct
101 Correct 181 ms 5352 KB Output is correct
102 Correct 826 ms 5608 KB Output is correct
103 Correct 816 ms 5640 KB Output is correct
104 Correct 917 ms 5864 KB Output is correct
105 Correct 667 ms 5768 KB Output is correct
106 Correct 664 ms 6004 KB Output is correct
107 Correct 584 ms 5736 KB Output is correct
108 Correct 2340 ms 17948 KB Output is correct
109 Correct 1776 ms 18948 KB Output is correct
110 Correct 1186 ms 11344 KB Output is correct
111 Correct 1316 ms 10348 KB Output is correct
112 Correct 698 ms 7656 KB Output is correct
113 Correct 237 ms 19060 KB Output is correct