oj.uz

Submission #133960

# Submission time Handle Problem Language Result Execution time Memory
133960 2019-07-21T19:19:56 Z egorlifar Fortune Telling 2 (JOI14_fortune_telling2) C++17
100 / 100
 624 ms 31732 KB 
/*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
 */
#include <bits/stdc++.h>
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>


using namespace std;
using namespace __gnu_pbds;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left224
#define right right224
#define next next224
#define rank rank224
#define prev prev224
#define y1 y1224
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
const string FILENAME = "input";
const int MAXN = 200228;
const int INF = 1e9;


typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int n, k;
int a[MAXN], b[MAXN], t[MAXN];
pair<int, int> p[MAXN];


struct rmq
{
    vector<int> d;
    int ss = 1;
    void init(int n) {
        while (ss < n) {
            ss <<= 1;
        }
        d.resize(2 * ss);
        for (int i = 0; i < 2 * ss; i++) {
            d[i] = -INF;
        }
    }
    void upd(int i, int val) {
        i += ss - 1;
        d[i] = val;
        while (i >> 1 > 0) {
            i >>= 1;
            d[i] = max(d[i * 2], d[i * 2 + 1]);
        }
    }
    int get(int l, int r) {
        l += ss - 1;
        r += ss - 1;
        int res = -INF;
        while (l <= r) {
            if (l & 1) {
                chkmax(res, d[l]);
                l++;
            }
            if (!(r & 1)) {
                chkmax(res, d[r]);
                r--;
            }
            l >>= 1;
            r >>= 1;
        }
        return res;
    }
};


rmq kek;


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //read(FILENAME);
    cin >> n >> k;
    vector<int> vx;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        vx.pb(a[i]);
        vx.pb(b[i]);
    }
    for (int i = 1; i <= k; i++) {
        cin >> t[i];
        vx.pb(t[i]);
    }
    sort(all(vx));
    vx.resize(distance(vx.begin(), unique(all(vx))));
    for (int i = 1; i <= n; i++) {
        a[i] = lower_bound(all(vx), a[i]) - vx.begin() + 1;
        b[i] = lower_bound(all(vx), b[i]) - vx.begin() + 1;
    }
    kek.init(sz(vx));
    vector<pair<int, int> > st;
    for (int i = 1; i <= k; i++) {
        int uk = lower_bound(all(vx), t[i]) - vx.begin() + 1;
        kek.upd(uk, i);
        st.pb({uk, i});
    }
    sort(all(st));
    for (int i = 1; i <= n; i++) {
        p[i] = {a[i], b[i]};
    }
    sort(p + 1, p + n + 1, [](pair<int, int> a, pair<int, int> b){return max(a.first, a.second) > max(b.first, b.second);});
    long long ans = 0;
    ordered_set certain;
    for (int i = 1; i <= n; i++) {
        int mn = min(p[i].first, p[i].second);
        int mx = max(p[i].first, p[i].second);
        while (sz(st) && st.back().first >= mx){
            certain.insert(st.back().second);
            st.pop_back();
        }
        int lastBetween = kek.get(mn, mx - 1);
        int remainingFlip = (sz(certain) - certain.order_of_key(lastBetween)) % 2;
        int id;
        if (lastBetween == -INF) {
            id = (remainingFlip ? p[i].second: p[i].first);
        }  else {
            id = (remainingFlip ? mn: mx);
        }
       // cout << id << endl;
        ans += vx[id - 1];
    }
    cout << ans << endl;
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 508 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 20 ms 1912 KB Output is correct
15 Correct 41 ms 3256 KB Output is correct
16 Correct 64 ms 4824 KB Output is correct
17 Correct 90 ms 6060 KB Output is correct
18 Correct 87 ms 6004 KB Output is correct
19 Correct 80 ms 5488 KB Output is correct
20 Correct 86 ms 6004 KB Output is correct
21 Correct 74 ms 4448 KB Output is correct
22 Correct 57 ms 4592 KB Output is correct
23 Correct 59 ms 4372 KB Output is correct
24 Correct 62 ms 4740 KB Output is correct
25 Correct 54 ms 4344 KB Output is correct
26 Correct 68 ms 5764 KB Output is correct
27 Correct 79 ms 5980 KB Output is correct
28 Correct 71 ms 6008 KB Output is correct
29 Correct 80 ms 6004 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 508 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 20 ms 1912 KB Output is correct
15 Correct 41 ms 3256 KB Output is correct
16 Correct 64 ms 4824 KB Output is correct
17 Correct 90 ms 6060 KB Output is correct
18 Correct 87 ms 6004 KB Output is correct
19 Correct 80 ms 5488 KB Output is correct
20 Correct 86 ms 6004 KB Output is correct
21 Correct 74 ms 4448 KB Output is correct
22 Correct 57 ms 4592 KB Output is correct
23 Correct 59 ms 4372 KB Output is correct
24 Correct 62 ms 4740 KB Output is correct
25 Correct 54 ms 4344 KB Output is correct
26 Correct 68 ms 5764 KB Output is correct
27 Correct 79 ms 5980 KB Output is correct
28 Correct 71 ms 6008 KB Output is correct
29 Correct 80 ms 6004 KB Output is correct
30 Correct 269 ms 17124 KB Output is correct
31 Correct 341 ms 21088 KB Output is correct
32 Correct 412 ms 23144 KB Output is correct
33 Correct 565 ms 31588 KB Output is correct
34 Correct 141 ms 9324 KB Output is correct
35 Correct 580 ms 31724 KB Output is correct
36 Correct 557 ms 31732 KB Output is correct
37 Correct 624 ms 31636 KB Output is correct
38 Correct 503 ms 28896 KB Output is correct
39 Correct 555 ms 31644 KB Output is correct
40 Correct 394 ms 24172 KB Output is correct
41 Correct 523 ms 30724 KB Output is correct
42 Correct 530 ms 31456 KB Output is correct
43 Correct 268 ms 23664 KB Output is correct
44 Correct 275 ms 23656 KB Output is correct
45 Correct 264 ms 23616 KB Output is correct
46 Correct 352 ms 22476 KB Output is correct
47 Correct 389 ms 23364 KB Output is correct
48 Correct 471 ms 27488 KB Output is correct
49 Correct 422 ms 27484 KB Output is correct