oj.uz

답안 #1063256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063256 2024-08-17T15:53:32 Z c2zi6 식물 비교 (IOI20_plants) C++14
100 / 100
 1547 ms 164368 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "plants.h"

struct MINARGSEGTREE {
    int n;
    VPI tree;
    VI lazy;
    MINARGSEGTREE(){}
    MINARGSEGTREE(int sz) {
        n = 1;
        while (n < sz) n *= 2;
        tree = VPI(2*n, {+1e9, -1});
        lazy = VI(2*n);
    }
    void push(int N) {
        tree[N].ff += lazy[N];
        if (2*N+2 < 2*n) {
            lazy[2*N+1] += lazy[N];
            lazy[2*N+2] += lazy[N];
        }
        lazy[N] = 0;
    }
    void set(int N, int L, int R, int i, PII s) {
        push(N);
        if (i < L || i > R) return;
        if (L == R) {
            tree[N] = s;
            return;
        }
        int M = (L + R) / 2;
        set(2*N+1, L, M, i, s);
        set(2*N+2, M+1, R, i, s);
        tree[N] = min(tree[2*N+1], tree[2*N+2]);
    }
    void add(int N, int L, int R, int l, int r, int s) {
        push(N);
        if (R < l || L > r) return;
        if (l <= L && R <= r) {
            lazy[N] = s;
            push(N);
            return;
        }
        int M = (L + R) / 2;
        add(2*N+1, L, M, l, r, s);
        add(2*N+2, M+1, R, l, r, s);
        tree[N] = min(tree[2*N+1], tree[2*N+2]);
    }
    PII get(int N, int L, int R, int l, int r) {
        push(N);
        if (l <= L && R <= r) return tree[N];
        if (R < l || L > r) return {+1e9, -1};
        int M = (L + R) / 2;
        return min(get(2*N+1, L, M, l, r), get(2*N+2, M+1, R, l, r));
    }
    void set(int i, int s) {
        set(0, 0, n-1, i, {s, i});
    }
    void add(int l, int r, int s) {
        add(0, 0, n-1, l, r, s);
    }
    PII get(int l, int r) {
        return get(0, 0, n-1, l, r);
    }
};
struct FIRSTZERODS {
    int n;
    MINARGSEGTREE seg;
    FIRSTZERODS(){}
    FIRSTZERODS(VI a) {
        n = a.size();
        seg = MINARGSEGTREE(n);
        rep(i, n) seg.set(i, a[i]);
    }
    void remove(int i) {
        seg.set(i, +1e9);
    }
    void decrement(int l, int r) {
        l = (l+100*n)%n;
        r = (r+100*n)%n;
        if (l <= r) seg.add(l, r, -1);
        else {
            seg.add(l, n-1, -1);
            seg.add(0, r, -1);
        }
    }
    int get(int l, int r) {
        l = (l+100*n)%n;
        r = (r+100*n)%n;
        PII ret;
        if (l <= r) ret = seg.get(l, r);
        else {
            ret = seg.get(l, n-1);
            if (ret.ff) ret = seg.get(0, r);
        }
        if (ret.ff == 0) return ret.ss;
        return -1;
    }
    void print() {
        rep(i, n) cout << seg.get(i, i).ff << " "; cout << endl;
    }
};

int n, k;
FIRSTZERODS seg;
VI a;
int mx;

VVI gp;

void extract(int i) {
    while (true) {
        int prev = seg.get(i-k+1, i-1);
        if (prev == -1) break;
        extract(prev);
    }
    a[i] = mx--;
    seg.remove(i);
    seg.decrement(i-k+1, i-1);
}

VI b;
VI pr, pl;
VVI parr, parl;

void init(int K_ARG, VI r) {
    k = K_ARG;
    n = r.size();
    seg = FIRSTZERODS(r);
    a = VI(n, -1);
    mx = n-1;
    while (mx >= 0) extract(seg.get(0, n-1));

    if (n <= 300) {
        gp = VVI(n, VI(n));
        rep(i, n) replr(jwm, i+1, i+k-1) {
            int j = jwm%n;
            if (a[j] > a[i]) gp[i][j] = true;
            else gp[j][i] = true;
        }
        rep(m, n) rep(u, n) rep(v, n) {
            gp[u][v] |= gp[u][m] && gp[m][v];
        }
    }
    rep(_, 3) for (int x : a) b.pb(x);
    pr = pl = VI(3*n);
    rep(i, 3*n) pr[i] = pl[i] = i;

    set<PII> st;
    replr(i, 0, k-1) st.insert({b[i], i});
    replr(i, 0, 3*n-1) {
        auto it = st.upper_bound({b[i], +2e9});
        if (it != st.end()) pr[i] = it->ss;
        st.erase({b[i], i});
        if (i+k < 3*n) st.insert({b[i+k], i+k});
    }
    st = set<PII>();
    reprl(i, 3*n-1, 3*n-k) st.insert({b[i], i});
    reprl(i, 3*n-1, 0) {
        auto it = st.upper_bound({b[i], +2e9});
        if (it != st.end()) pl[i] = it->ss;
        st.erase({b[i], i});
        if (i-k >= 0) st.insert({b[i-k], i-k});
    }

    parr = parl = VVI(3*n, VI(21));
    rep(i, 3*n) {
        parr[i][0] = pr[i];
        parl[i][0] = pl[i];
    }
    replr(k, 1, 20) {
        rep(i, 3*n) {
            parl[i][k] = parl[parl[i][k-1]][k-1];
            parr[i][k] = parr[parr[i][k-1]][k-1];
        }
    }
    /*rep(i, 3*n) cout << i << "\t"; cout << endl;*/
    /*for (int x : b) cout << x <<  " "; cout << endl;*/
    /*for (int x : pr) cout << x << " "; cout << endl;*/
    /*for (int x : pl) cout << x << " "; cout << endl;*/
}

bool goright(int x, int y) {
    reprl(k, 20, 0) if (parr[x][k] < y) x = parr[x][k];
    return y <= x+k-1 && b[y] > b[x];
}
bool goleft(int x, int y) {
    reprl(k, 20, 0) if (parl[x][k] > y) x = parl[x][k];
    return x <= y+k-1 && b[y] > b[x];
}
bool issmaller(int x, int y) {
    if (y > x) return goright(x, y) || goleft(x, y-n);
    return goright(x, y+n) || goleft(x, y);
}

int cp1(int x, int y) {
    x += n;
    y += n;
    if (issmaller(x, y)) return -1;
    if (issmaller(y, x)) return +1;
    return 0;
}

int cp2(int x, int y) {
    if (gp[y][x]) return +1;
    if (gp[x][y]) return -1;
    return 0;
}

int compare_plants(int x, int y) {
    return cp1(x, y);
    for (int x : a) cout << x << " "; cout << endl << endl;
    cout << cp1(x, y) << " " << cp2(x, y) << endl;
    return -314;
    if (cp1(x, y) != cp2(x, y)) {
        rep(i, 200) cout << "VAX QU ";
        cout << endl;

        cout << x << " " << y << endl;
        abort();
    } else return cp2(x, y);

    if (n <= 300) {
    }
    if (a[x] > a[y]) return +1;
    if (a[x] < a[y]) return -1;
	return 0;
}

Compilation message

plants.cpp: In member function 'void FIRSTZERODS::print()':
plants.cpp:9:19: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    9 | #define rep(i, n) for (int i = 0; i < int(n); ++i)
      |                   ^~~
plants.cpp:129:9: note: in expansion of macro 'rep'
  129 |         rep(i, n) cout << seg.get(i, i).ff << " "; cout << endl;
      |         ^~~
plants.cpp:129:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  129 |         rep(i, n) cout << seg.get(i, i).ff << " "; cout << endl;
      |                                                    ^~~~
plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:241:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  241 |     for (int x : a) cout << x << " "; cout << endl << endl;
      |     ^~~
plants.cpp:241:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  241 |     for (int x : a) cout << x << " "; cout << endl << endl;
      |                                       ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 73 ms 3800 KB Output is correct
7 Correct 142 ms 20268 KB Output is correct
8 Correct 606 ms 160864 KB Output is correct
9 Correct 595 ms 162364 KB Output is correct
10 Correct 588 ms 160856 KB Output is correct
11 Correct 604 ms 160820 KB Output is correct
12 Correct 654 ms 162072 KB Output is correct
13 Correct 663 ms 161040 KB Output is correct
14 Correct 509 ms 161856 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 5 ms 1216 KB Output is correct
7 Correct 85 ms 8424 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 89 ms 8276 KB Output is correct
11 Correct 110 ms 8264 KB Output is correct
12 Correct 61 ms 8504 KB Output is correct
13 Correct 88 ms 8268 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 5 ms 1216 KB Output is correct
7 Correct 85 ms 8424 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 89 ms 8276 KB Output is correct
11 Correct 110 ms 8264 KB Output is correct
12 Correct 61 ms 8504 KB Output is correct
13 Correct 88 ms 8268 KB Output is correct
14 Correct 169 ms 20176 KB Output is correct
15 Correct 1492 ms 162616 KB Output is correct
16 Correct 165 ms 20176 KB Output is correct
17 Correct 1512 ms 162392 KB Output is correct
18 Correct 986 ms 162004 KB Output is correct
19 Correct 804 ms 160572 KB Output is correct
20 Correct 1405 ms 159748 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 92 ms 5648 KB Output is correct
4 Correct 788 ms 164276 KB Output is correct
5 Correct 949 ms 161124 KB Output is correct
6 Correct 1108 ms 162568 KB Output is correct
7 Correct 1208 ms 161284 KB Output is correct
8 Correct 1547 ms 161340 KB Output is correct
9 Correct 932 ms 161588 KB Output is correct
10 Correct 780 ms 161296 KB Output is correct
11 Correct 702 ms 161028 KB Output is correct
12 Correct 587 ms 161556 KB Output is correct
13 Correct 1014 ms 162308 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 35 ms 1892 KB Output is correct
8 Correct 34 ms 1916 KB Output is correct
9 Correct 36 ms 1912 KB Output is correct
10 Correct 37 ms 1876 KB Output is correct
11 Correct 36 ms 1884 KB Output is correct
12 Correct 36 ms 1844 KB Output is correct
13 Correct 38 ms 1916 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 803 ms 162052 KB Output is correct
7 Correct 938 ms 162104 KB Output is correct
8 Correct 1149 ms 160768 KB Output is correct
9 Correct 1393 ms 162068 KB Output is correct
10 Correct 851 ms 161344 KB Output is correct
11 Correct 991 ms 161820 KB Output is correct
12 Correct 664 ms 164368 KB Output is correct
13 Correct 905 ms 161148 KB Output is correct
14 Correct 1002 ms 160812 KB Output is correct
15 Correct 1242 ms 161216 KB Output is correct
16 Correct 683 ms 161592 KB Output is correct
17 Correct 809 ms 160816 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 73 ms 3800 KB Output is correct
7 Correct 142 ms 20268 KB Output is correct
8 Correct 606 ms 160864 KB Output is correct
9 Correct 595 ms 162364 KB Output is correct
10 Correct 588 ms 160856 KB Output is correct
11 Correct 604 ms 160820 KB Output is correct
12 Correct 654 ms 162072 KB Output is correct
13 Correct 663 ms 161040 KB Output is correct
14 Correct 509 ms 161856 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 5 ms 1216 KB Output is correct
21 Correct 85 ms 8424 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 5 ms 1116 KB Output is correct
24 Correct 89 ms 8276 KB Output is correct
25 Correct 110 ms 8264 KB Output is correct
26 Correct 61 ms 8504 KB Output is correct
27 Correct 88 ms 8268 KB Output is correct
28 Correct 169 ms 20176 KB Output is correct
29 Correct 1492 ms 162616 KB Output is correct
30 Correct 165 ms 20176 KB Output is correct
31 Correct 1512 ms 162392 KB Output is correct
32 Correct 986 ms 162004 KB Output is correct
33 Correct 804 ms 160572 KB Output is correct
34 Correct 1405 ms 159748 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 432 KB Output is correct
37 Correct 92 ms 5648 KB Output is correct
38 Correct 788 ms 164276 KB Output is correct
39 Correct 949 ms 161124 KB Output is correct
40 Correct 1108 ms 162568 KB Output is correct
41 Correct 1208 ms 161284 KB Output is correct
42 Correct 1547 ms 161340 KB Output is correct
43 Correct 932 ms 161588 KB Output is correct
44 Correct 780 ms 161296 KB Output is correct
45 Correct 702 ms 161028 KB Output is correct
46 Correct 587 ms 161556 KB Output is correct
47 Correct 1014 ms 162308 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 3 ms 604 KB Output is correct
54 Correct 35 ms 1892 KB Output is correct
55 Correct 34 ms 1916 KB Output is correct
56 Correct 36 ms 1912 KB Output is correct
57 Correct 37 ms 1876 KB Output is correct
58 Correct 36 ms 1884 KB Output is correct
59 Correct 36 ms 1844 KB Output is correct
60 Correct 38 ms 1916 KB Output is correct
61 Correct 92 ms 5620 KB Output is correct
62 Correct 145 ms 20168 KB Output is correct
63 Correct 736 ms 162364 KB Output is correct
64 Correct 885 ms 161028 KB Output is correct
65 Correct 1052 ms 161856 KB Output is correct
66 Correct 1202 ms 162328 KB Output is correct
67 Correct 1438 ms 162104 KB Output is correct
68 Correct 936 ms 162868 KB Output is correct
69 Correct 1028 ms 161104 KB Output is correct
70 Correct 914 ms 163584 KB Output is correct
71 Correct 1045 ms 162616 KB Output is correct
72 Correct 1104 ms 162496 KB Output is correct
73 Correct 1228 ms 161080 KB Output is correct
74 Correct 751 ms 161976 KB Output is correct
75 Correct 842 ms 162024 KB Output is correct