oj.uz

Submission #506245

# Submission time Handle Problem Language Result Execution time Memory
506245 2022-01-11T23:19:54 Z colossal_pepe Fortune Telling 2 (JOI14_fortune_telling2) C++17
100 / 100
 452 ms 35740 KB 
#include <algorithm>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
using namespace __gnu_pbds;
 
#define pow2(p) (1 << (p))
 
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
             tree_order_statistics_node_update> ordered_set;
 
int n, k;
vector<int> a, b, t, flips;
 
void makePancakes() {
    vector<int> t_sorted = t;
    sort(t_sorted.begin(), t_sorted.end());
    for (int i = 0; i < n; i++) {
        flips[i] += t_sorted.end() -
                    lower_bound(t_sorted.begin(), t_sorted.end(), max(a[i], b[i]));
    }
}
 
void adjustFlips() {
    vector<pair<int, int>> tp(k);
    for (int i = 0; i < k; i++) {
        tp[i].first = t[i];
        tp[i].second = i;
    }
    sort(tp.begin(), tp.end());
    int st[k][20];
    memset(st, 0, sizeof(st));
    for (int i = 0; i < k; i++) {
        st[i][0] = tp[i].second;
    }
    for (int j = 1; j < 20; j++) {
        for (int i = 0; i + pow2(j) - 1 < k; i++) {
            st[i][j] = max(st[i][j - 1], st[i + pow2(j - 1)][j - 1]);
        }
    }
    int log2[200005];
    log2[1] = 0;
    for (int i = 2; i < 200005; i++) {
        log2[i] = log2[i / 2] + 1;
    }
    vector<pair<int, int>> p(n);
    for (int i = 0; i < n; i++) {
        p[i].second = i;
        int l =
            lower_bound(tp.begin(), tp.end(), make_pair(min(a[i], b[i]), -1)) - tp.begin();
        int r =
            lower_bound(tp.begin(), tp.end(), make_pair(max(a[i], b[i]), -1)) - tp.begin();
        if (l == r) {
            p[i].first = k;
            continue;
        }
        flips[i] += (b[i] > a[i]);
        int len = r - l, j = log2[r - l];
        p[i].first = max(st[l][j], st[l + len - pow2(j)][j]);
    }
    sort(p.begin(), p.end());
    int ti = 0, pi = 0;
    ordered_set os;
    while (ti < k) {
        os.insert({t[ti], ti});
        while (pi < n and p[pi].first == ti) {
            flips[p[pi].second] -= os.size() - os.order_of_key({max(a[p[pi].second], b[p[pi].second]), -1});
            pi++;
        }
        ti++;
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    a.resize(n), b.resize(n), flips.resize(n);
    t.resize(k);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }
    for (int i = 0; i < k; i++) {
        cin >> t[i];
    }
    makePancakes();
    adjustFlips();
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        if (flips[i] % 2) ans += b[i];
        else ans += a[i];
    }
    cout << ans << endl;
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1228 KB Output is correct
2 Correct 1 ms 1228 KB Output is correct
3 Correct 2 ms 1228 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 3 ms 1224 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 3 ms 1228 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1228 KB Output is correct
2 Correct 1 ms 1228 KB Output is correct
3 Correct 2 ms 1228 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 3 ms 1224 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 3 ms 1228 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 12 ms 2764 KB Output is correct
15 Correct 26 ms 4532 KB Output is correct
16 Correct 40 ms 6152 KB Output is correct
17 Correct 59 ms 7920 KB Output is correct
18 Correct 54 ms 7972 KB Output is correct
19 Correct 53 ms 7924 KB Output is correct
20 Correct 55 ms 7912 KB Output is correct
21 Correct 51 ms 7864 KB Output is correct
22 Correct 38 ms 7972 KB Output is correct
23 Correct 43 ms 7972 KB Output is correct
24 Correct 40 ms 7964 KB Output is correct
25 Correct 37 ms 7984 KB Output is correct
26 Correct 47 ms 7856 KB Output is correct
27 Correct 51 ms 7972 KB Output is correct
28 Correct 48 ms 7992 KB Output is correct
29 Correct 48 ms 7976 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1228 KB Output is correct
2 Correct 1 ms 1228 KB Output is correct
3 Correct 2 ms 1228 KB Output is correct
4 Correct 2 ms 1228 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 3 ms 1224 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 3 ms 1228 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 12 ms 2764 KB Output is correct
15 Correct 26 ms 4532 KB Output is correct
16 Correct 40 ms 6152 KB Output is correct
17 Correct 59 ms 7920 KB Output is correct
18 Correct 54 ms 7972 KB Output is correct
19 Correct 53 ms 7924 KB Output is correct
20 Correct 55 ms 7912 KB Output is correct
21 Correct 51 ms 7864 KB Output is correct
22 Correct 38 ms 7972 KB Output is correct
23 Correct 43 ms 7972 KB Output is correct
24 Correct 40 ms 7964 KB Output is correct
25 Correct 37 ms 7984 KB Output is correct
26 Correct 47 ms 7856 KB Output is correct
27 Correct 51 ms 7972 KB Output is correct
28 Correct 48 ms 7992 KB Output is correct
29 Correct 48 ms 7976 KB Output is correct
30 Correct 232 ms 31728 KB Output is correct
31 Correct 263 ms 32584 KB Output is correct
32 Correct 300 ms 33492 KB Output is correct
33 Correct 417 ms 35688 KB Output is correct
34 Correct 187 ms 31596 KB Output is correct
35 Correct 390 ms 35544 KB Output is correct
36 Correct 452 ms 35740 KB Output is correct
37 Correct 378 ms 35536 KB Output is correct
38 Correct 438 ms 35608 KB Output is correct
39 Correct 388 ms 35436 KB Output is correct
40 Correct 350 ms 35644 KB Output is correct
41 Correct 376 ms 35632 KB Output is correct
42 Correct 403 ms 35624 KB Output is correct
43 Correct 307 ms 35436 KB Output is correct
44 Correct 257 ms 35568 KB Output is correct
45 Correct 247 ms 35540 KB Output is correct
46 Correct 302 ms 35424 KB Output is correct
47 Correct 324 ms 35592 KB Output is correct
48 Correct 356 ms 35416 KB Output is correct
49 Correct 363 ms 35504 KB Output is correct