oj.uz

답안 #301568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301568 2020-09-18T04:40:47 Z kevinsogo 식물 비교 (IOI20_plants) C++17
100 / 100
 1578 ms 137536 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int mod(int a, int n) {
    if ((a %= n) < 0) a += n;
    return a;
}

int n, k;
int dist(int i, int j) {
    return mod(j - i - 1, n) + 1;
}

struct MinTree {
    int i, j;
    int m, a = 0;
    MinTree *l, *r;
    MinTree(const vector<int>& v, int i, int j): i(i), j(j) {
        if (j - i == 1) {
            m = v[i];
            l = r = nullptr;
        } else {
            int k = i + j >> 1;
            l = new MinTree(v, i, k);
            r = new MinTree(v, k, j);
            m = min(l->m, r->m);
        }
    }

    void visit() {
        if (a) {
            m += a;
            if (l) l->a += a, r->a += a;
            a = 0;
        }
    }
    
    void inc(int I, int J, int A) {
        if (I <= i && j <= J) {
            a += A;
            visit();
        } else {
            visit();
            if (!(J <= i || j <= I)) {
                l->inc(I, J, A);
                r->inc(I, J, A);
                m = min(l->m, r->m);
            }
        }
    }

    void get0s(int I, int J, vector<int>& t) {
        visit();
        if (m > 0 || J <= i || j <= I) return;
        if (l) {
            l->get0s(I, J, t);
            r->get0s(I, J, t);
        } else {
            t.push_back(i);
        }
    }
};

struct MaxTree {
    int i, j;
    pair<int,int> m;
    MaxTree *l, *r;
    MaxTree(int v, int i, int j): i(i), j(j), m(v, i) {
        if (j - i == 1) {
            l = r = nullptr;
        } else {
            int k = i + j >> 1;
            l = new MaxTree(v, i, k);
            r = new MaxTree(v, k, j);
        }
    }

    void write(int I, int v) {
        if (i <= I && I < j) {
            if (l) {
                l->write(I, v);
                r->write(I, v);
                m = std::max(l->m, r->m);
            } else {
                m = {v, i};
            }
        }
    }

    pair<int,int> max(int I, int J) {
        if (I <= i && j <= J) {
            return m;
        } else if (J <= i || j <= I) {
            return {-2, -2};
        } else {
            return std::max(l->max(I, J), r->max(I, J));
        }
    }
};

struct TreeTree {
    int k;
    vector<vector<int>> anc;
    vector<vector<ll>> ancd;
    TreeTree() {}
    TreeTree(const vector<int>& par, const vector<ll>& pard) {
        int n = par.size();
        for (k = 0; 1 << k <= n; k++);
        anc = vector<vector<int>>(k, vector<int>(n, -1));
        ancd = vector<vector<ll>>(k, vector<ll>(n, -1));
        anc[0] = par;
        ancd[0] = pard;
        for (int kk = 0; kk < k - 1; kk++) {
            for (int i = 0; i < n; i++) {
                int j = anc[kk][i];
                anc[kk + 1][i] = anc[kk][j];
                ancd[kk + 1][i] = ancd[kk][i] + ancd[kk][j];
            }
        }
    }

    pair<int,ll> walk_up(int i, ll d) {
        for (int kk = k; kk--;) {
            if (d >= ancd[kk][i]) {
                d -= ancd[kk][i];
                i = anc[kk][i];
            }
        }
        return {i, d};
    }
};

vector<int> vals;
TreeTree rttree, lftree;
void init(int k_, vector<int> r) {
    k = k_;
    n = r.size();
    vals = vector<int>(n);

    MinTree curr(r, 0, n);
    vector<int> likod(n), harap(n);
    unordered_set<int> oks;

    vector<int> cands;
    for (int i = 0; i < n; i++) if (!r[i]) cands.push_back(i);
    for (int x2 = 0, x1 = cands.size() - 1; x2 < cands.size(); x1 = x2++) {
        int j1 = cands[x1], j2 = cands[x2];
        harap[j1] = j2;
        likod[j2] = j1;
        if (dist(j1, j2) >= k) oks.insert(j2);
    }
    
    for (int v = n; v; v--) {
        int j = *oks.begin();
        int j1 = likod[j], j2 = harap[j];
        oks.erase(j);
        vals[j] = v;
        curr.inc(j, j + 1, n + 1);
        curr.inc(j - k + 1 + n, j + n, -1);
        curr.inc(j - k + 1, j, -1);

        vector<int> bagos;
        curr.get0s(j - k + 1 + n, j + n, bagos);
        curr.get0s(j - k + 1, j, bagos);

        if (v > 1) {
            if (j == j1 && j == j2) {
                j1 = bagos.back();
                j2 = bagos.front();
            }

            bagos.insert(bagos.begin(), j1);
            bagos.push_back(j2);
            for (int x1 = 0, x2 = 1; x2 < bagos.size(); x1++, x2++) {
                int j1 = bagos[x1], j2 = bagos[x2];
                harap[j1] = j2;
                likod[j2] = j1;
                if (dist(j1, j2) >= k) {
                    oks.insert(j2);
                } else if (oks.count(j2)) {
                    oks.erase(j2);
                }
            }
        }
    }

    vector<int> lfs(n, -1), rts(n, -1);
    MaxTree wals(-1, 0, n);
    vector<int> inds(n);
    iota(inds.begin(), inds.end(), 0);
    sort(inds.begin(), inds.end(), [&](int i, int j) { return vals[i] < vals[j]; });
    for (int x : inds) {
        wals.write(x, 0);
        int m;
        tie(m, lfs[x]) = max(wals.max(x - k + 1, x + 1), wals.max(x - k + 1 + n, x + 1 + n));
        tie(m, rts[x]) = max(wals.max(x, x + k), wals.max(x - n, x + k - n));
        wals.write(x, vals[x]);
    }

    vector<ll> lfdists(n), rtdists(n);
    for (int i = 0; i < n; i++) {
        lfdists[i] = dist(lfs[i], i);
        rtdists[i] = dist(i, rts[i]);
    }

    lftree = TreeTree(lfs, lfdists);
    rttree = TreeTree(rts, rtdists);
}

bool is_fixed_right(int x, int y) {
    auto [X, rem] = rttree.walk_up(x, dist(x, y));
    return rem < k && vals[X] >= vals[y];
}

bool is_fixed_left(int x, int y) {
    auto [X, rem] = lftree.walk_up(x, dist(y, x));
    return rem < k && vals[X] >= vals[y];
}

int compare_plants(int x, int y) {
    int mul = 1;
    if (vals[x] < vals[y]) {
        swap(x, y);
        mul = -1;
    }

    return (is_fixed_right(x, y) || is_fixed_left(x, y)) * mul;
}

Compilation message

plants.cpp: In constructor 'MinTree::MinTree(const std::vector<int>&, int, int)':
plants.cpp:25:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |             int k = i + j >> 1;
      |                     ~~^~~
plants.cpp: In constructor 'MaxTree::MaxTree(int, int, int)':
plants.cpp:74:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   74 |             int k = i + j >> 1;
      |                     ~~^~~
plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:148:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |     for (int x2 = 0, x1 = cands.size() - 1; x2 < cands.size(); x1 = x2++) {
      |                                             ~~~^~~~~~~~~~~~~~
plants.cpp:176:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  176 |             for (int x1 = 0, x2 = 1; x2 < bagos.size(); x1++, x2++) {
      |                                      ~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 66 ms 3192 KB Output is correct
7 Correct 187 ms 15000 KB Output is correct
8 Correct 813 ms 137156 KB Output is correct
9 Correct 822 ms 137028 KB Output is correct
10 Correct 881 ms 137156 KB Output is correct
11 Correct 854 ms 137156 KB Output is correct
12 Correct 850 ms 137156 KB Output is correct
13 Correct 884 ms 137468 KB Output is correct
14 Correct 995 ms 136652 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 95 ms 6008 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 96 ms 5880 KB Output is correct
11 Correct 110 ms 5880 KB Output is correct
12 Correct 116 ms 6136 KB Output is correct
13 Correct 92 ms 5880 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 95 ms 6008 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 96 ms 5880 KB Output is correct
11 Correct 110 ms 5880 KB Output is correct
12 Correct 116 ms 6136 KB Output is correct
13 Correct 92 ms 5880 KB Output is correct
14 Correct 163 ms 15000 KB Output is correct
15 Correct 1567 ms 136780 KB Output is correct
16 Correct 168 ms 15000 KB Output is correct
17 Correct 1552 ms 136780 KB Output is correct
18 Correct 1020 ms 137028 KB Output is correct
19 Correct 1043 ms 136780 KB Output is correct
20 Correct 1245 ms 136652 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 104 ms 4216 KB Output is correct
4 Correct 1048 ms 136900 KB Output is correct
5 Correct 1137 ms 136844 KB Output is correct
6 Correct 1417 ms 136652 KB Output is correct
7 Correct 1552 ms 136652 KB Output is correct
8 Correct 1543 ms 136820 KB Output is correct
9 Correct 969 ms 136960 KB Output is correct
10 Correct 1064 ms 136780 KB Output is correct
11 Correct 879 ms 137536 KB Output is correct
12 Correct 1059 ms 136652 KB Output is correct
13 Correct 1032 ms 137356 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 20 ms 1024 KB Output is correct
8 Correct 17 ms 1152 KB Output is correct
9 Correct 20 ms 1024 KB Output is correct
10 Correct 17 ms 1152 KB Output is correct
11 Correct 19 ms 1152 KB Output is correct
12 Correct 20 ms 1024 KB Output is correct
13 Correct 16 ms 1152 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 910 ms 136780 KB Output is correct
7 Correct 1207 ms 136652 KB Output is correct
8 Correct 1389 ms 136780 KB Output is correct
9 Correct 1578 ms 136844 KB Output is correct
10 Correct 734 ms 136904 KB Output is correct
11 Correct 1075 ms 136652 KB Output is correct
12 Correct 829 ms 136900 KB Output is correct
13 Correct 856 ms 136780 KB Output is correct
14 Correct 1175 ms 136908 KB Output is correct
15 Correct 1448 ms 136652 KB Output is correct
16 Correct 856 ms 136780 KB Output is correct
17 Correct 803 ms 136672 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 66 ms 3192 KB Output is correct
7 Correct 187 ms 15000 KB Output is correct
8 Correct 813 ms 137156 KB Output is correct
9 Correct 822 ms 137028 KB Output is correct
10 Correct 881 ms 137156 KB Output is correct
11 Correct 854 ms 137156 KB Output is correct
12 Correct 850 ms 137156 KB Output is correct
13 Correct 884 ms 137468 KB Output is correct
14 Correct 995 ms 136652 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 95 ms 6008 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 96 ms 5880 KB Output is correct
25 Correct 110 ms 5880 KB Output is correct
26 Correct 116 ms 6136 KB Output is correct
27 Correct 92 ms 5880 KB Output is correct
28 Correct 163 ms 15000 KB Output is correct
29 Correct 1567 ms 136780 KB Output is correct
30 Correct 168 ms 15000 KB Output is correct
31 Correct 1552 ms 136780 KB Output is correct
32 Correct 1020 ms 137028 KB Output is correct
33 Correct 1043 ms 136780 KB Output is correct
34 Correct 1245 ms 136652 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 104 ms 4216 KB Output is correct
38 Correct 1048 ms 136900 KB Output is correct
39 Correct 1137 ms 136844 KB Output is correct
40 Correct 1417 ms 136652 KB Output is correct
41 Correct 1552 ms 136652 KB Output is correct
42 Correct 1543 ms 136820 KB Output is correct
43 Correct 969 ms 136960 KB Output is correct
44 Correct 1064 ms 136780 KB Output is correct
45 Correct 879 ms 137536 KB Output is correct
46 Correct 1059 ms 136652 KB Output is correct
47 Correct 1032 ms 137356 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 0 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 1 ms 256 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 20 ms 1024 KB Output is correct
55 Correct 17 ms 1152 KB Output is correct
56 Correct 20 ms 1024 KB Output is correct
57 Correct 17 ms 1152 KB Output is correct
58 Correct 19 ms 1152 KB Output is correct
59 Correct 20 ms 1024 KB Output is correct
60 Correct 16 ms 1152 KB Output is correct
61 Correct 91 ms 4088 KB Output is correct
62 Correct 189 ms 15000 KB Output is correct
63 Correct 927 ms 137036 KB Output is correct
64 Correct 1069 ms 136780 KB Output is correct
65 Correct 1348 ms 136780 KB Output is correct
66 Correct 1521 ms 136652 KB Output is correct
67 Correct 1565 ms 136712 KB Output is correct
68 Correct 961 ms 136908 KB Output is correct
69 Correct 1305 ms 136732 KB Output is correct
70 Correct 1004 ms 137028 KB Output is correct
71 Correct 1190 ms 136776 KB Output is correct
72 Correct 1417 ms 136668 KB Output is correct
73 Correct 1554 ms 136780 KB Output is correct
74 Correct 930 ms 136844 KB Output is correct
75 Correct 1049 ms 136596 KB Output is correct