oj.uz

답안 #228180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228180 2020-04-30T06:13:42 Z tri 운세 보기 2 (JOI14_fortune_telling2) C++14
100 / 100
 2522 ms 166268 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

namespace debug {
    const int DEBUG = true;

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { if (DEBUG) cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"), cout << flush; }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;


static const int MAXN = 600100, NODES = 9 * MAXN;
const int INF = 1e9;

struct SegTr {
    int tr[4 * MAXN];

    void b(int i, int l, int r, vi &o) {
        if (l == r) {
            tr[i] = o[l];
            return;
        }
        int mid = (l + r) / 2;
        b(i * 2, l, mid, o);
        b(i * 2 + 1, mid + 1, r, o);
        tr[i] = min(tr[i * 2], tr[i * 2 + 1]);
    }

    int q(int i, int l, int r, int s, int e) {
        if (e < l || r < s) {
            return INF;
        }
        if (s <= l && r <= e) {
            return tr[i];
        }
        int mid = (l + r) / 2;
        return min(q(i * 2, l, mid, s, e), q(i * 2 + 1, mid + 1, r, s, e));
    }
} segTr;


int lC[NODES], rC[NODES], tr[NODES];
int nx = 0;

inline int cpy(int o) {
    int n = nx++;
    lC[n] = lC[o], rC[n] = rC[o], tr[n] = tr[o];
    return n;
}

int b(int l, int r) {
    if (l == r) {
        tr[nx] = 0;
        return nx++;
    }
    int mid = (l + r) / 2;
    lC[nx] = b(l, mid);
    rC[nx] = b(mid + 1, r);
    return nx++;
}

// q does not create any new nodes
int q(int i, int l, int r, int s, int e) {
    if (e < l || r < s) {
        return 0;
    }
    if (s <= l && r <= e) {
        return tr[i];
    }
    int mid = (l + r) / 2;
    return q(lC[i], l, mid, s, e) +
           q(rC[i], mid + 1, r, s, e);
}

// returns index of updated node
int u(int i, int l, int r, int x, int d) {
    i = cpy(i);
    if (l == r) {
        tr[i] += d;
        return i;
    }
    int mid = (l + r) / 2;
    if (x <= mid) {
        lC[i] = u(lC[i], l, mid, x, d);
    } else {
        rC[i] = u(rC[i], mid + 1, r, x, d);
    }
    tr[i] = tr[lC[i]] + tr[rC[i]];
    return i;
}

int N, K;

pi c[MAXN];

int op[MAXN];

int rt[MAXN];

set<int> vals;
map<int, int> mp;
map<int, int> rMp;

int nV;

int main() {
    cin >> N >> K;

    for (int i = 0; i < N; i++) {
        cin >> c[i].f >> c[i].s;
        vals.insert(c[i].f);
        vals.insert(c[i].s);
    }
    for (int i = 0; i < K; i++) {
        cin >> op[K - i];
        vals.insert(op[K - i]);
    }

    nV = 0;
    for (int x : vals) {
        mp[x] = nV;
        rMp[nV] = x;
        nV++;
    }

    for (int i = 0; i < N; i++) {
        c[i].f = mp[c[i].f];
        c[i].s = mp[c[i].s];
    }

    for (int i = 0; i < K; i++) {
        op[K - i] = mp[op[K - i]];
    }

    assert(nV <= MAXN);

    rt[0] = b(0, nV);
    for (int i = 1; i <= K; i++) {
        rt[i] = u(rt[i - 1], 0, nV, op[i], 1);
    }

    vi o(nV + 1);
    fill(o.begin(), o.end(), INF);
    for (int i = K; i >= 1; i--) {
        o[op[i]] = i;
    }
    segTr.b(1, 0, nV, o);

    ll ans = 0;
    for (int i = 0; i < N; i++) {
//        ps(c[i]);
        int small = min(c[i].f, c[i].s);
        int big = max(c[i].f, c[i].s);

        if (small == big) {
//            ps("add", rMp[small]);
            ans += rMp[small];
            continue;
        }

        int force = segTr.q(1, 0, nV, small, big - 1);
        force = min(force, K + 1);
//        ps(force);

        int flip = q(rt[force - 1], 0, nV, big, nV);

        if (force == K + 1 && c[i].f == small) flip++;

//        ps(flip);
        if (flip & 1) {
//            ps("add", rMp[small]);
            ans += rMp[small];
        } else {
//            ps("add", rMp[big]);
            ans += rMp[big];
        }
    }
    cout << ans << endl;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 9 ms 1152 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 9 ms 1156 KB Output is correct
6 Correct 9 ms 1152 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 9 ms 1152 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 9 ms 1152 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 9 ms 1156 KB Output is correct
6 Correct 9 ms 1152 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 9 ms 1152 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct
14 Correct 64 ms 8056 KB Output is correct
15 Correct 144 ms 15668 KB Output is correct
16 Correct 214 ms 23544 KB Output is correct
17 Correct 312 ms 31096 KB Output is correct
18 Correct 302 ms 30968 KB Output is correct
19 Correct 323 ms 31096 KB Output is correct
20 Correct 300 ms 30968 KB Output is correct
21 Correct 299 ms 31096 KB Output is correct
22 Correct 180 ms 24060 KB Output is correct
23 Correct 163 ms 19936 KB Output is correct
24 Correct 140 ms 17272 KB Output is correct
25 Correct 195 ms 26104 KB Output is correct
26 Correct 194 ms 22776 KB Output is correct
27 Correct 227 ms 23928 KB Output is correct
28 Correct 205 ms 24156 KB Output is correct
29 Correct 291 ms 27512 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 9 ms 1152 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 9 ms 1156 KB Output is correct
6 Correct 9 ms 1152 KB Output is correct
7 Correct 9 ms 1024 KB Output is correct
8 Correct 9 ms 1152 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 9 ms 1024 KB Output is correct
14 Correct 64 ms 8056 KB Output is correct
15 Correct 144 ms 15668 KB Output is correct
16 Correct 214 ms 23544 KB Output is correct
17 Correct 312 ms 31096 KB Output is correct
18 Correct 302 ms 30968 KB Output is correct
19 Correct 323 ms 31096 KB Output is correct
20 Correct 300 ms 30968 KB Output is correct
21 Correct 299 ms 31096 KB Output is correct
22 Correct 180 ms 24060 KB Output is correct
23 Correct 163 ms 19936 KB Output is correct
24 Correct 140 ms 17272 KB Output is correct
25 Correct 195 ms 26104 KB Output is correct
26 Correct 194 ms 22776 KB Output is correct
27 Correct 227 ms 23928 KB Output is correct
28 Correct 205 ms 24156 KB Output is correct
29 Correct 291 ms 27512 KB Output is correct
30 Correct 694 ms 85752 KB Output is correct
31 Correct 1041 ms 102528 KB Output is correct
32 Correct 1471 ms 121144 KB Output is correct
33 Correct 2499 ms 160728 KB Output is correct
34 Correct 597 ms 83508 KB Output is correct
35 Correct 2522 ms 166264 KB Output is correct
36 Correct 2486 ms 166120 KB Output is correct
37 Correct 2492 ms 166224 KB Output is correct
38 Correct 2482 ms 166188 KB Output is correct
39 Correct 2460 ms 166264 KB Output is correct
40 Correct 2200 ms 165992 KB Output is correct
41 Correct 2439 ms 166084 KB Output is correct
42 Correct 2461 ms 166268 KB Output is correct
43 Correct 1325 ms 165476 KB Output is correct
44 Correct 1294 ms 165368 KB Output is correct
45 Correct 1308 ms 165368 KB Output is correct
46 Correct 1088 ms 107256 KB Output is correct
47 Correct 944 ms 86904 KB Output is correct
48 Correct 1602 ms 127108 KB Output is correct
49 Correct 1568 ms 126968 KB Output is correct