oj.uz

답안 #263354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
263354 2020-08-13T16:04:34 Z keko37 Cake 3 (JOI19_cake3) C++14
100 / 100
 1472 ms 12008 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long llint;
typedef pair <int, int> pi;

const int MAXN = 200005;
const llint INF = 1000000000000000000LL;

llint n, m, sum, sol = -INF, br;
pi p[MAXN];
int pos[MAXN], fen[MAXN];
vector <pi> v, saz;

bool cmp (pi a, pi b) {
    return a.second < b.second;
}

void fen_ubaci (int x, int k) {
    for (; x < MAXN; x += x&-x) fen[x] += k;
}

int get () {
    int res = 0;
    for (int i = 17; i >= 0; i--) {
        if (res + (1 << i) < MAXN && fen[res + (1 << i)] == 0) res += (1 << i);
    }
    return res + 1;
}

void ubaci (int ind) {
    //cout << "ubaci " << ind << endl;
    sum += p[ind].first; br++;
    fen_ubaci(pos[ind], 1);
    if (br > m - 2) {
        int mn = get();
        sum -= saz[mn - 1].first; br--;
        fen_ubaci(mn, -1);
        v.push_back({ind, mn});
    } else {
        v.push_back({ind, 0});
    }
}

void rollback () {
    int ind = v.back().first, mn = v.back().second;
    //cout << "rollback " << ind << " " << mn << endl;
    v.pop_back();
    if (mn) {
        sum += saz[mn - 1].first; br++;
        fen_ubaci(mn, 1);
    }
    sum -= p[ind].first; br--;
    fen_ubaci(pos[ind], -1);
}

void calc (int lef, int rig, int lo, int hi) {
    if (lef > rig) return;
    //cout << "calc " << lef << " " << rig << " " << lo << " " << hi << endl;
    int mid = (lef + rig) / 2;
    //cout << "mid je " << mid << endl;
    for (int i = max(hi + 1, lef); i < mid; i++) {
        ubaci(i);
    }
    llint res = -INF, piv = -1;
    for (int i = min(mid - 1, hi); i >= lo; i--) {
        if (br == m - 2) {
            llint tmp = sum + p[i].first + p[i].second;
            if (tmp > res) {
                res = tmp;
                piv = i;
            }
        }
        ubaci(i);
    }
    //cout << "piv je " << piv << endl;
    sol = max(sol, res + p[mid].first - p[mid].second);

    for (int i = lo; i <= min(mid - 1, hi); i++) rollback();
    if (hi < mid) ubaci(mid);
    calc(mid + 1, rig, piv, hi);
    if (hi < mid) rollback();

    for (int i = max(hi + 1, lef); i < mid; i++) rollback();
    for (int i = piv + 1; i <= min(lef - 1, hi); i++) ubaci(i);
    calc(lef, mid - 1, lo, piv);
    for (int i = piv + 1; i <= min(lef - 1, hi); i++) rollback();
}

void sazmi () {
    sort(saz.begin(), saz.end());
    for (int i = 0; i < n; i++) {
        int ind = saz[i].second;
        pos[ind] = i + 1;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> p[i].first >> p[i].second;
        p[i].second *= 2;
    }
    sort(p, p + n, cmp);
    for (int i = 0; i < n; i++) {
        saz.push_back({p[i].first, i});
    }
    sazmi();
    calc(m - 1, n - 1, 0, n - 1);
    cout << sol;
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 10 ms 512 KB Output is correct
39 Correct 10 ms 512 KB Output is correct
40 Correct 7 ms 488 KB Output is correct
41 Correct 7 ms 512 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 7 ms 512 KB Output is correct
45 Correct 9 ms 632 KB Output is correct
46 Correct 8 ms 512 KB Output is correct
47 Correct 8 ms 512 KB Output is correct
48 Correct 7 ms 512 KB Output is correct
49 Correct 6 ms 512 KB Output is correct
50 Correct 6 ms 512 KB Output is correct
51 Correct 6 ms 512 KB Output is correct
52 Correct 6 ms 512 KB Output is correct
53 Correct 7 ms 512 KB Output is correct
54 Correct 5 ms 512 KB Output is correct
55 Correct 4 ms 512 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 5 ms 512 KB Output is correct
60 Correct 7 ms 512 KB Output is correct
61 Correct 5 ms 512 KB Output is correct
62 Correct 5 ms 640 KB Output is correct
63 Correct 7 ms 540 KB Output is correct
64 Correct 5 ms 512 KB Output is correct
65 Correct 8 ms 512 KB Output is correct
66 Correct 7 ms 512 KB Output is correct
67 Correct 8 ms 512 KB Output is correct
68 Correct 7 ms 512 KB Output is correct
69 Correct 7 ms 512 KB Output is correct
70 Correct 7 ms 512 KB Output is correct
71 Correct 5 ms 512 KB Output is correct
72 Correct 5 ms 512 KB Output is correct
73 Correct 9 ms 512 KB Output is correct
74 Correct 2 ms 512 KB Output is correct
75 Correct 1284 ms 8060 KB Output is correct
76 Correct 1472 ms 7912 KB Output is correct
77 Correct 1134 ms 8040 KB Output is correct
78 Correct 1207 ms 11496 KB Output is correct
79 Correct 341 ms 11628 KB Output is correct
80 Correct 501 ms 11368 KB Output is correct
81 Correct 981 ms 9924 KB Output is correct
82 Correct 1195 ms 9704 KB Output is correct
83 Correct 1105 ms 10084 KB Output is correct
84 Correct 1168 ms 9960 KB Output is correct
85 Correct 1020 ms 9764 KB Output is correct
86 Correct 700 ms 10476 KB Output is correct
87 Correct 701 ms 10600 KB Output is correct
88 Correct 904 ms 9324 KB Output is correct
89 Correct 893 ms 10780 KB Output is correct
90 Correct 705 ms 11108 KB Output is correct
91 Correct 589 ms 10564 KB Output is correct
92 Correct 606 ms 10472 KB Output is correct
93 Correct 643 ms 10728 KB Output is correct
94 Correct 607 ms 11008 KB Output is correct
95 Correct 717 ms 11176 KB Output is correct
96 Correct 528 ms 9476 KB Output is correct
97 Correct 554 ms 10860 KB Output is correct
98 Correct 547 ms 10084 KB Output is correct
99 Correct 524 ms 10732 KB Output is correct
100 Correct 486 ms 10348 KB Output is correct
101 Correct 477 ms 10344 KB Output is correct
102 Correct 1090 ms 9448 KB Output is correct
103 Correct 964 ms 9320 KB Output is correct
104 Correct 1077 ms 9704 KB Output is correct
105 Correct 877 ms 10860 KB Output is correct
106 Correct 896 ms 10984 KB Output is correct
107 Correct 805 ms 10724 KB Output is correct
108 Correct 1204 ms 11368 KB Output is correct
109 Correct 1058 ms 11756 KB Output is correct
110 Correct 559 ms 9984 KB Output is correct
111 Correct 623 ms 8940 KB Output is correct
112 Correct 1218 ms 9776 KB Output is correct
113 Correct 125 ms 12008 KB Output is correct