oj.uz

Submission #885370

# Submission time Handle Problem Language Result Execution time Memory
885370 2023-12-09T14:32:25 Z Koyote Fortune Telling 2 (JOI14_fortune_telling2) C++11
100 / 100
 326 ms 66288 KB 
#include <bits/stdc++.h>
using namespace std;

#define TASK "flip"
 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

// Segment Tree (iterative)
template<class S, S (*op)(S, S), S (*e)()> struct segtree {
  private:
    int _n, _size, _log;
    vector<S> d;
    void updateS(int k) { d[k] = op(d[k << 1], d[k << 1 | 1]); }
    constexpr bool ineq(int x, int y, int z) const { return x <= y && y < z; }
  public:
    segtree() : segtree(0) {}
    explicit segtree(int __n) : segtree(vector<S>(__n, e())) {}
    explicit segtree(const vector<S> &v) : _n((int)v.size()) {
        _log = 31 - __builtin_clz(_n) + ((_n & -_n) != _n), _size = 1 << _log;
        d = vector<S>(_size << 1, e());
        for (int i = 0; i < _n; ++i) d[_size + i] = v[i];
        for (int i = _size - 1; i > 0; --i) updateS(i);
    }

    S query(int l, int r) { // [l, r)
        assert(ineq(0, l, r + 1) && ineq(l, r, _n + 1));
        S sml = e(), smr = e();
        for (l += _size, r += _size; l < r; l >>= 1, r >>= 1) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
        }
        return op(sml, smr);
    }
};

int op(int x, int y) { return max(x, y); }
int e() { return 0; }
// End of Segment Tree (iterative)

// Merge Sort Tree
template<class T> struct merge_sort_tree {
    int _l, _r, _m;
    vector<T> v;
    merge_sort_tree *lt, *rt;
    merge_sort_tree(int l, int r, const vector<T> &e) : _l(l), _r(r), _m((l + r) >> 1) {
        v.resize(r - l + 1), v[0] = e[l];
        if (l == r) lt = rt = nullptr;
        else {
            lt = new merge_sort_tree(_l, _m, e);
            rt = new merge_sort_tree(_m + 1, _r, e);
            vector<T> v1 = lt->v, v2 = rt->v;
            v.resize(v1.size() + v2.size());
            merge(all(v1), all(v2), v.begin());
        }
    }
    int count(int l, int r, T a, T b) {
        if (a > b) return 0;
        if (l > _r || r < _l) return 0;
        if (_l >= l && _r <= r) return upper_bound(all(v), b) - lower_bound(all(v), a);
        return lt->count(l, r, a, b) + rt->count(l, r, a, b);
    }
};
// End of Merge Sort Tree
 
const int N = 2e5 + 7;
int n, k, a[N], b[N], t[N], t_idx[N * 3];
 
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK ".inp", "r")) {
        freopen(TASK ".inp", "r", stdin);
        freopen(TASK ".out", "w", stdout);
    }
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    for (int i = 1; i <= k; i++) cin >> t[i];
 
    basic_string<int> cmpr; cmpr.reserve(2 * n + k + 1), cmpr += 0;
    for (int i = 1; i <= n; i++) cmpr += a[i], cmpr += b[i];
    for (int i = 1; i <= k; i++) cmpr += t[i];
    sort(all(cmpr)), cmpr.erase(unique(all(cmpr)), cmpr.end());

    auto search = [&](const int v) -> int { return lower_bound(all(cmpr), v) - cmpr.begin(); };
    for (int i = 1; i <= n; i++) a[i] = search(a[i]), b[i] = search(b[i]);
    for (int i = 1; i <= k; i++) t[i] = search(t[i]), t_idx[t[i]] = i;
 
    // Segment Tree (iterative)
    segtree<int, op, e> stree(vector<int>(t_idx, t_idx + sz(cmpr) + 1));
    auto query_max_t_idx = [&](int l, int r) -> int { return stree.query(l, r + 1); };
    // End of Segment Tree (iterative)


    // Merge Sort Tree
    merge_sort_tree<int> mst(0, k + 1, vector<int>(t, t + k + 1));
    auto cnt_on_range = [&](int l, int r, int x, int y) -> int {
        // Number of i that (l <= i <= r) and (x <= a[i] <= y)
        return mst.count(l, r, x, y);
    };
    // End of Merge Sort Tree
 
    basic_string<int> ans; ans.reserve(n);
    for (int i = 1; i <= n; i++) {
        if (a[i] == b[i]) { ans += cmpr[a[i]]; continue; }
        bool swapped = (a[i] > b[i] ? (swap(a[i], b[i]), true) : false);
        int last_pos = query_max_t_idx(a[i], b[i] - 1);
        int cnt_flipped = cnt_on_range(last_pos + 1, k, b[i], sz(cmpr));
 
        if (last_pos != 0 || swapped) swap(a[i], b[i]);
        ans += cmpr[~cnt_flipped & 1 ? a[i] : b[i]];
    }
    // for (int i : ans) cout << i << ' ';
    cout << accumulate(ans.begin(), ans.end(), 0LL) << '\n';
}

Compilation message

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen(TASK ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen(TASK ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 12 ms 5212 KB Output is correct
15 Correct 27 ms 10096 KB Output is correct
16 Correct 37 ms 13188 KB Output is correct
17 Correct 51 ms 15736 KB Output is correct
18 Correct 52 ms 15732 KB Output is correct
19 Correct 50 ms 15736 KB Output is correct
20 Correct 53 ms 15740 KB Output is correct
21 Correct 49 ms 15736 KB Output is correct
22 Correct 40 ms 15908 KB Output is correct
23 Correct 44 ms 15464 KB Output is correct
24 Correct 39 ms 15288 KB Output is correct
25 Correct 39 ms 15848 KB Output is correct
26 Correct 50 ms 15668 KB Output is correct
27 Correct 83 ms 15888 KB Output is correct
28 Correct 54 ms 15888 KB Output is correct
29 Correct 107 ms 15816 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 12 ms 5212 KB Output is correct
15 Correct 27 ms 10096 KB Output is correct
16 Correct 37 ms 13188 KB Output is correct
17 Correct 51 ms 15736 KB Output is correct
18 Correct 52 ms 15732 KB Output is correct
19 Correct 50 ms 15736 KB Output is correct
20 Correct 53 ms 15740 KB Output is correct
21 Correct 49 ms 15736 KB Output is correct
22 Correct 40 ms 15908 KB Output is correct
23 Correct 44 ms 15464 KB Output is correct
24 Correct 39 ms 15288 KB Output is correct
25 Correct 39 ms 15848 KB Output is correct
26 Correct 50 ms 15668 KB Output is correct
27 Correct 83 ms 15888 KB Output is correct
28 Correct 54 ms 15888 KB Output is correct
29 Correct 107 ms 15816 KB Output is correct
30 Correct 123 ms 57832 KB Output is correct
31 Correct 156 ms 60368 KB Output is correct
32 Correct 202 ms 60652 KB Output is correct
33 Correct 290 ms 65864 KB Output is correct
34 Correct 114 ms 57720 KB Output is correct
35 Correct 293 ms 65920 KB Output is correct
36 Correct 288 ms 65820 KB Output is correct
37 Correct 298 ms 65836 KB Output is correct
38 Correct 311 ms 65836 KB Output is correct
39 Correct 296 ms 66072 KB Output is correct
40 Correct 281 ms 65828 KB Output is correct
41 Correct 288 ms 65908 KB Output is correct
42 Correct 290 ms 66288 KB Output is correct
43 Correct 209 ms 65912 KB Output is correct
44 Correct 222 ms 65836 KB Output is correct
45 Correct 219 ms 65776 KB Output is correct
46 Correct 211 ms 61928 KB Output is correct
47 Correct 242 ms 59780 KB Output is correct
48 Correct 326 ms 61756 KB Output is correct
49 Correct 290 ms 61756 KB Output is correct