oj.uz

Submission #1063258

# Submission time Handle Problem Language Result Execution time Memory
1063258 2024-08-17T15:55:49 Z c2zi6 Comparing Plants (IOI20_plants) C++14
100 / 100
 1537 ms 162364 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;

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));
    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];
        }
    }
}

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 compare_plants(int x, int y) {
    x += n;
    y += n;
    if (issmaller(x, y)) return -1;
    if (issmaller(y, x)) 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;
      |                                                    ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
6 Correct 64 ms 3132 KB Output is correct
7 Correct 157 ms 18900 KB Output is correct
8 Correct 570 ms 160484 KB Output is correct
9 Correct 606 ms 159504 KB Output is correct
10 Correct 594 ms 159544 KB Output is correct
11 Correct 598 ms 159800 KB Output is correct
12 Correct 608 ms 160312 KB Output is correct
13 Correct 682 ms 159544 KB Output is correct
14 Correct 541 ms 160268 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 5 ms 1116 KB Output is correct
7 Correct 84 ms 6984 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 103 ms 6996 KB Output is correct
11 Correct 108 ms 6992 KB Output is correct
12 Correct 59 ms 7248 KB Output is correct
13 Correct 86 ms 6988 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 5 ms 1116 KB Output is correct
7 Correct 84 ms 6984 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 103 ms 6996 KB Output is correct
11 Correct 108 ms 6992 KB Output is correct
12 Correct 59 ms 7248 KB Output is correct
13 Correct 86 ms 6988 KB Output is correct
14 Correct 165 ms 18892 KB Output is correct
15 Correct 1476 ms 160612 KB Output is correct
16 Correct 162 ms 18892 KB Output is correct
17 Correct 1537 ms 159248 KB Output is correct
18 Correct 950 ms 159504 KB Output is correct
19 Correct 837 ms 159028 KB Output is correct
20 Correct 1419 ms 159564 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 120 ms 4592 KB Output is correct
4 Correct 887 ms 162364 KB Output is correct
5 Correct 918 ms 159764 KB Output is correct
6 Correct 1167 ms 159172 KB Output is correct
7 Correct 1252 ms 160028 KB Output is correct
8 Correct 1516 ms 159020 KB Output is correct
9 Correct 1002 ms 159412 KB Output is correct
10 Correct 854 ms 159960 KB Output is correct
11 Correct 666 ms 160528 KB Output is correct
12 Correct 577 ms 159796 KB Output is correct
13 Correct 937 ms 159288 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 16 ms 1212 KB Output is correct
8 Correct 14 ms 1116 KB Output is correct
9 Correct 17 ms 1112 KB Output is correct
10 Correct 14 ms 1212 KB Output is correct
11 Correct 23 ms 1200 KB Output is correct
12 Correct 16 ms 1116 KB Output is correct
13 Correct 19 ms 1228 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory 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 4 ms 1116 KB Output is correct
6 Correct 813 ms 159508 KB Output is correct
7 Correct 962 ms 159016 KB Output is correct
8 Correct 1174 ms 160532 KB Output is correct
9 Correct 1391 ms 160264 KB Output is correct
10 Correct 824 ms 160960 KB Output is correct
11 Correct 939 ms 160780 KB Output is correct
12 Correct 682 ms 162100 KB Output is correct
13 Correct 900 ms 160916 KB Output is correct
14 Correct 996 ms 160560 KB Output is correct
15 Correct 1110 ms 160276 KB Output is correct
16 Correct 666 ms 159028 KB Output is correct
17 Correct 768 ms 159544 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
6 Correct 64 ms 3132 KB Output is correct
7 Correct 157 ms 18900 KB Output is correct
8 Correct 570 ms 160484 KB Output is correct
9 Correct 606 ms 159504 KB Output is correct
10 Correct 594 ms 159544 KB Output is correct
11 Correct 598 ms 159800 KB Output is correct
12 Correct 608 ms 160312 KB Output is correct
13 Correct 682 ms 159544 KB Output is correct
14 Correct 541 ms 160268 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 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 5 ms 1116 KB Output is correct
21 Correct 84 ms 6984 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 5 ms 1116 KB Output is correct
24 Correct 103 ms 6996 KB Output is correct
25 Correct 108 ms 6992 KB Output is correct
26 Correct 59 ms 7248 KB Output is correct
27 Correct 86 ms 6988 KB Output is correct
28 Correct 165 ms 18892 KB Output is correct
29 Correct 1476 ms 160612 KB Output is correct
30 Correct 162 ms 18892 KB Output is correct
31 Correct 1537 ms 159248 KB Output is correct
32 Correct 950 ms 159504 KB Output is correct
33 Correct 837 ms 159028 KB Output is correct
34 Correct 1419 ms 159564 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 120 ms 4592 KB Output is correct
38 Correct 887 ms 162364 KB Output is correct
39 Correct 918 ms 159764 KB Output is correct
40 Correct 1167 ms 159172 KB Output is correct
41 Correct 1252 ms 160028 KB Output is correct
42 Correct 1516 ms 159020 KB Output is correct
43 Correct 1002 ms 159412 KB Output is correct
44 Correct 854 ms 159960 KB Output is correct
45 Correct 666 ms 160528 KB Output is correct
46 Correct 577 ms 159796 KB Output is correct
47 Correct 937 ms 159288 KB Output is correct
48 Correct 0 ms 344 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 0 ms 348 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 16 ms 1212 KB Output is correct
55 Correct 14 ms 1116 KB Output is correct
56 Correct 17 ms 1112 KB Output is correct
57 Correct 14 ms 1212 KB Output is correct
58 Correct 23 ms 1200 KB Output is correct
59 Correct 16 ms 1116 KB Output is correct
60 Correct 19 ms 1228 KB Output is correct
61 Correct 82 ms 4692 KB Output is correct
62 Correct 146 ms 18892 KB Output is correct
63 Correct 719 ms 159752 KB Output is correct
64 Correct 852 ms 159288 KB Output is correct
65 Correct 1031 ms 160572 KB Output is correct
66 Correct 1173 ms 160316 KB Output is correct
67 Correct 1480 ms 160316 KB Output is correct
68 Correct 947 ms 161084 KB Output is correct
69 Correct 1145 ms 158992 KB Output is correct
70 Correct 913 ms 162064 KB Output is correct
71 Correct 1072 ms 160484 KB Output is correct
72 Correct 1102 ms 160268 KB Output is correct
73 Correct 1291 ms 160316 KB Output is correct
74 Correct 795 ms 160192 KB Output is correct
75 Correct 873 ms 159764 KB Output is correct