oj.uz

Submission #311618

# Submission time Handle Problem Language Result Execution time Memory
311618 2020-10-10T19:08:14 Z IgorI Comparing Plants (IOI20_plants) C++17
100 / 100
 1423 ms 50552 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
 
const int N = 500000;
const int INF = 1e9;
 
int c;
int n;
int H[N];
int k;
 
pair<int, int> tree[4 * N];
int push[4 * N];
 
pair<int, int> Merge(pair<int, int> a, pair<int, int> b)
{
    return min(a, b);
}
 
void Push(int V)
{
    tree[2 * V + 1].first += push[V];
    tree[2 * V + 2].first += push[V];
    push[2 * V + 1] += push[V];
    push[2 * V + 2] += push[V];
    push[V] = 0;
}
 
void Build(int L, int R, int V, vector<int> &r)
{
    if (L + 1 == R)
    {
        tree[V] = {r[L], L};
        return;
    }
    int M = (L + R) / 2;
    Build(L, M, 2 * V + 1, r);
    Build(M, R, 2 * V + 2, r);
    tree[V] = Merge(tree[2 * V + 1], tree[2 * V + 2]);
}
 
pair<int, int> Get(int l, int r, int L = 0, int R = n, int V = 0)
{
    if (r <= L || R <= l) return {INF, 0};
    if (l <= L && R <= r) return tree[V];
    int M = (L + R) / 2;
    Push(V);
    return Merge(Get(l, r, L, M, 2 * V + 1), Get(l, r, M, R, 2 * V + 2));
}
 
void Add(int l, int r, int x, int L = 0, int R = n, int V = 0)
{
    if (r <= L || R <= l) return;
    if (l <= L && R <= r)
    {
        tree[V].first += x;
        push[V] += x;
        return;
    }
    int M = (L + R) / 2;
    Push(V);
    Add(l, r, x, L, M, 2 * V + 1);
    Add(l, r, x, M, R, 2 * V + 2);
    tree[V] = Merge(tree[2 * V + 1], tree[2 * V + 2]);
}
 
int CGet(int l, int r)
{
    if (l < 0)
    {
        l += n;
        pair<int, int> a = Get(l, n);
        pair<int, int> b = Get(0, r);
        if (a.first == 0) return a.second;
        if (b.first == 0) return b.second;
        return -1;
    }
    pair<int, int> a = Get(l, r);
    if (a.first == 0) return a.second;
    return -1;
}
 
void CAdd(int l, int r, int x)
{
    if (l < 0)
    {
        l += n;
        Add(l, n, x);
        Add(0, r, x);
    }
    else
    {
        Add(l, r, x);
    }
}
 
pair<int, int> tree2[4 * N];
 
void Build2(int L = 0, int R = n, int V = 0)
{
    tree2[V] = {INF, L};
    if (L + 1 == R) return;
    int M = (L + R) / 2;
    Build2(L, M, 2 * V + 1);
    Build2(M, R, 2 * V + 2);
}
 
void Set2(int pos, int x, int L = 0, int R = n, int V = 0)
{
    if (L + 1 == R)
    {
        tree2[V] = {x, L};
        return;
    }
    int M = (L + R) / 2;
    if (pos < M) Set2(pos, x, L, M, 2 * V + 1);
    else Set2(pos, x, M, R, 2 * V + 2);
    tree2[V] = min(tree2[2 * V + 1], tree2[2 * V + 2]);
}
 
pair<int, int> Get2(int l, int r, int L = 0, int R = n, int V = 0)
{
    if (r <= L || R <= l) return {INF, 0};
    if (l <= L && R <= r) return tree2[V];
    int M = (L + R) / 2;
    return min(Get2(l, r, L, M, 2 * V + 1), Get2(l, r, M, R, 2 * V + 2));
}
 
int up_left[N], up_right[N];
 
int CGet2(int l, int r)
{
    if (l < 0 || r > n)
    {
        if (l < 0) l += n;
        if (r > n) r -= n;
        pair<int, int> a = Get2(l, n);
        pair<int, int> b = Get2(0, r);
        if (min(a, b).first < INF)
            return min(a, b).second;
        return -1;
    }
    pair<int, int> a = Get2(l, r);
    if (a.first < INF) return a.second;
    return -1;
}
 
void call(int i, int k, vector<int> &r, vector<int> &h1)
{
    int id = CGet(i - k + 1, i);
    while (id != -1)
    {
        call(id, k, r, h1);
        id = CGet(i - k + 1, i);
    }
    up_right[i] = CGet2(i + 1, i + k);
    up_left[i] = CGet2(i - k + 1, i);
    h1[i] = c--;
    Set2(i, h1[i]);
    CAdd(i - k + 1, i, -1);
    CAdd(i, i + 1, INF);
}
 
const int LG = 20;
 
int le[LG][N], ri[LG][N];
 
void init(int K, vector<int> r)
{
    k = K;
    n = r.size();
    vector<int> h1(n);
    c = n;
 
    Build(0, n, 0, r);
    Build2();
 
    int id = CGet(0, n);
    while (id != -1)
    {
        call(id, k, r, h1);
        id = CGet(0, n);
    }
    for (int i = 0; i < n; i++)
    {
        H[i] = h1[i];
    }
    for (int i = 0; i < n; i++)
    {
        if (up_left[i] != -1)
        {
            le[0][i] = i - up_left[i];
            if (le[0][i] < 0) le[0][i] += n;
        } else le[0][i] = INF;
        if (up_right[i] != -1)
        {
            ri[0][i] = up_right[i] - i;
            if (ri[0][i] < 0) ri[0][i] += n;
        } else ri[0][i] = INF;
    }
    for (int j = 1; j < LG; j++)
    {
        for (int i = 0; i < n; i++)
        {
            if (le[j - 1][i] < INF)
                le[j][i] = min(le[j - 1][i] + le[j - 1][((i - le[j - 1][i]) % n + n) % n], INF);
            else
                le[j][i] = INF;
            if (ri[j - 1][i] < INF)
                ri[j][i] = min(ri[j - 1][i] + ri[j - 1][(i + ri[j - 1][i]) % n], INF);
            else
                ri[j][i] = INF;
        }
    }
}
 
int Dist(int x, int y)
{
    if (x < y) return min(y - x, n - y + x);
    return min(x - y, n - x + y);
}
 
int compare_plants(int x, int y)
{
    if (Dist(x, y) < k)
    {
        if (H[x] <= H[y]) return -1;
        return 1;
    }
    int d, dist;
    d = x;
    dist = y - x;
    for (int j = LG - 1; j >= 0; j--)
    {
        if (ri[j][d] <= dist)
        {
            dist -= ri[j][d];
            d += ri[j][d];
            if (d >= n) d -= n;
        }
    }
    if (Dist(d, y) < k && H[d] <= H[y]) return -1;
    d = x;
    dist = x - y + n;
    for (int j = LG - 1; j >= 0; j--)
    {
        if (le[j][d] <= dist)
        {
            dist -= le[j][d];
            d -= le[j][d];
            if (d < 0) d += n;
        }
    }
    if (Dist(d, y) < k && H[d] <= H[y]) return -1;
 
    swap(x, y);
    d = x;
    dist = y - x + n;
    for (int j = LG - 1; j >= 0; j--)
    {
        if (ri[j][d] <= dist)
        {
            dist -= ri[j][d];
            d += ri[j][d];
            if (d >= n) d -= n;
        }
    }
    if (Dist(d, y) < k && H[d] <= H[y]) return 1;
    d = x;
    dist = x - y;
    for (int j = LG - 1; j >= 0; j--)
    {
        if (le[j][d] <= dist)
        {
            dist -= le[j][d];
            d -= le[j][d];
            if (d < 0) d += n;
        }
    }
    if (Dist(d, y) < k && H[d] <= H[y]) return 1;
    return 0;
}
 
#ifdef LOCAL
int main()
{
    int n, k, q;
    cin >> n >> k >> q;
    vector<int> r(n);
    for (int i = 0; i < n; i++) cin >> r[i];
    init(k, r);
    while (q--)
    {
        int x, y;
        cin >> x >> y;
        cout << compare_plants(x, y) << endl;
    }
}
#endif

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 85 ms 3448 KB Output is correct
7 Correct 184 ms 8412 KB Output is correct
8 Correct 714 ms 49276 KB Output is correct
9 Correct 780 ms 49272 KB Output is correct
10 Correct 817 ms 49272 KB Output is correct
11 Correct 872 ms 49272 KB Output is correct
12 Correct 908 ms 49272 KB Output is correct
13 Correct 1036 ms 49284 KB Output is correct
14 Correct 752 ms 49272 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 89 ms 4856 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 86 ms 4728 KB Output is correct
11 Correct 83 ms 4600 KB Output is correct
12 Correct 84 ms 4856 KB Output is correct
13 Correct 92 ms 4860 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 89 ms 4856 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 86 ms 4728 KB Output is correct
11 Correct 83 ms 4600 KB Output is correct
12 Correct 84 ms 4856 KB Output is correct
13 Correct 92 ms 4860 KB Output is correct
14 Correct 151 ms 8412 KB Output is correct
15 Correct 1197 ms 49340 KB Output is correct
16 Correct 149 ms 8412 KB Output is correct
17 Correct 1196 ms 49272 KB Output is correct
18 Correct 778 ms 49212 KB Output is correct
19 Correct 771 ms 49400 KB Output is correct
20 Correct 1062 ms 49272 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 672 KB Output is correct
3 Correct 132 ms 3964 KB Output is correct
4 Correct 1037 ms 50212 KB Output is correct
5 Correct 1091 ms 49424 KB Output is correct
6 Correct 1372 ms 49272 KB Output is correct
7 Correct 1406 ms 49400 KB Output is correct
8 Correct 1219 ms 49272 KB Output is correct
9 Correct 1091 ms 49400 KB Output is correct
10 Correct 1080 ms 49272 KB Output is correct
11 Correct 1045 ms 49272 KB Output is correct
12 Correct 867 ms 49284 KB Output is correct
13 Correct 972 ms 49400 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 26 ms 1408 KB Output is correct
8 Correct 18 ms 1408 KB Output is correct
9 Correct 26 ms 1408 KB Output is correct
10 Correct 18 ms 1408 KB Output is correct
11 Correct 26 ms 1400 KB Output is correct
12 Correct 24 ms 1400 KB Output is correct
13 Correct 16 ms 1408 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 910 ms 49528 KB Output is correct
7 Correct 1055 ms 49400 KB Output is correct
8 Correct 1289 ms 49272 KB Output is correct
9 Correct 1214 ms 49276 KB Output is correct
10 Correct 829 ms 49304 KB Output is correct
11 Correct 912 ms 49272 KB Output is correct
12 Correct 818 ms 50552 KB Output is correct
13 Correct 995 ms 49400 KB Output is correct
14 Correct 1149 ms 49216 KB Output is correct
15 Correct 1168 ms 49204 KB Output is correct
16 Correct 787 ms 49276 KB Output is correct
17 Correct 846 ms 49324 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 85 ms 3448 KB Output is correct
7 Correct 184 ms 8412 KB Output is correct
8 Correct 714 ms 49276 KB Output is correct
9 Correct 780 ms 49272 KB Output is correct
10 Correct 817 ms 49272 KB Output is correct
11 Correct 872 ms 49272 KB Output is correct
12 Correct 908 ms 49272 KB Output is correct
13 Correct 1036 ms 49284 KB Output is correct
14 Correct 752 ms 49272 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 640 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 89 ms 4856 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 86 ms 4728 KB Output is correct
25 Correct 83 ms 4600 KB Output is correct
26 Correct 84 ms 4856 KB Output is correct
27 Correct 92 ms 4860 KB Output is correct
28 Correct 151 ms 8412 KB Output is correct
29 Correct 1197 ms 49340 KB Output is correct
30 Correct 149 ms 8412 KB Output is correct
31 Correct 1196 ms 49272 KB Output is correct
32 Correct 778 ms 49212 KB Output is correct
33 Correct 771 ms 49400 KB Output is correct
34 Correct 1062 ms 49272 KB Output is correct
35 Correct 1 ms 640 KB Output is correct
36 Correct 1 ms 672 KB Output is correct
37 Correct 132 ms 3964 KB Output is correct
38 Correct 1037 ms 50212 KB Output is correct
39 Correct 1091 ms 49424 KB Output is correct
40 Correct 1372 ms 49272 KB Output is correct
41 Correct 1406 ms 49400 KB Output is correct
42 Correct 1219 ms 49272 KB Output is correct
43 Correct 1091 ms 49400 KB Output is correct
44 Correct 1080 ms 49272 KB Output is correct
45 Correct 1045 ms 49272 KB Output is correct
46 Correct 867 ms 49284 KB Output is correct
47 Correct 972 ms 49400 KB Output is correct
48 Correct 1 ms 640 KB Output is correct
49 Correct 1 ms 640 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 1 ms 640 KB Output is correct
52 Correct 1 ms 640 KB Output is correct
53 Correct 3 ms 768 KB Output is correct
54 Correct 26 ms 1408 KB Output is correct
55 Correct 18 ms 1408 KB Output is correct
56 Correct 26 ms 1408 KB Output is correct
57 Correct 18 ms 1408 KB Output is correct
58 Correct 26 ms 1400 KB Output is correct
59 Correct 24 ms 1400 KB Output is correct
60 Correct 16 ms 1408 KB Output is correct
61 Correct 132 ms 3916 KB Output is correct
62 Correct 203 ms 8412 KB Output is correct
63 Correct 922 ms 49276 KB Output is correct
64 Correct 1095 ms 49272 KB Output is correct
65 Correct 1369 ms 49272 KB Output is correct
66 Correct 1370 ms 49304 KB Output is correct
67 Correct 1230 ms 49272 KB Output is correct
68 Correct 1094 ms 49400 KB Output is correct
69 Correct 969 ms 49272 KB Output is correct
70 Correct 1081 ms 50424 KB Output is correct
71 Correct 1310 ms 49376 KB Output is correct
72 Correct 1400 ms 49272 KB Output is correct
73 Correct 1423 ms 49272 KB Output is correct
74 Correct 931 ms 49272 KB Output is correct
75 Correct 1051 ms 49212 KB Output is correct