oj.uz

Submission #872086

# Submission time Handle Problem Language Result Execution time Memory
872086 2023-11-12T09:28:17 Z sleepntsheep Ball Machine (BOI13_ballmachine) C++17
0 / 100
 1000 ms 10488 KB 
#include <iostream>
#include <bitset>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 100000

int root, n, q, L[N], J[N], P[N], alloc, ta[N], h[N], tin[N], rv[N], timer, t[N<<1];
char lz[N];
struct { int v, l; } g[N-1];

inline void link(int u, int v) {
    if (h[u]) g[++alloc] = {v, 0}, g[ta[u]].l = alloc, ta[u] = alloc;
    else g[++alloc] = {v, h[u]}, h[u] = ta[u] = alloc;
}

inline void push(int v, int l, int r)
{
    if (-1 == lz[v]) return;
    t[v] = lz[v] * (r-l+1);
    if (l != r) 
    {
        int m = (l+r)/2, vl=v+1, vr=v+(m-l+1)*2;
        lz[vl] = lz[vr] = lz[v];
    }
    lz[v] = -1;
}

int qry(int x, int y, int v = 0, int l = 0, int r = n - 1)
{
    push(v, l, r);
    if (y < l || r < x) return 0;
    if (x <= l && r <= y) return t[v];
    int m = (l+r)/2, vl =v + 1, vr=v+(m-l+1)*2;
    return qry(x, y, vl, l, m) + qry(x, y, vr, m+1, r);
}

int qry(int u) { return qry(tin[u], tin[u]); }

void update(int x, int y, int k, int v = 0, int l = 0, int r = n - 1)
{
    push(v, l, r);
    if (y < l || r < x) return;
    int m = (l+r)/2, vl =v + 1, vr=v+(m-l+1)*2;
    if (x <= l && r <= y) {lz[v] = k; push(v, l, r); return; }
    update(x, y, k, vl, l, m), update(x, y, k, vr, m+1, r);
    t[v] = t[vl]+t[vr];
}

void dfs(int u)
{
    for (auto j = h[u]; j; j = g[j].l)
    {
        P[g[j].v] = u;
        if (L[u] - L[J[u]] == L[J[u]] - L[J[J[u]]]) J[g[j].v] = J[J[u]];
        else J[g[j].v] = u;
        L[g[j].v] = L[u] + 1;
        dfs(g[j].v);
    }
    rv[tin[u] = timer++] = u;
}

int highest(int u)
{
    for (; u != P[u]; )
    {
        if (qry(J[u])) u = J[u];
        else if (qry(P[u])) u = P[u];
        else break;
    }
    return u;
}

int main()
{
    ShinLena;
    cin >> n >> q;
    for (int i = 0; i < n; ++i) cin >> P[i], (P[i] ? link(P[i]-1, i) : void(root = i));
    P[root] = root;
    memset(lz, -1, sizeof lz);
    dfs(root);
    for (int t, k; q--;)
    {
        cin >> t >> k;
        if (t == 1)
        {
            int l = 0, r = n - 1;
            while (l <= r)
            {
                int m = (l+r)/2;
                if (qry(0, m) <= k) l = m + 1;
                else r = m - 1;
            }
            cout << rv[l-1] + 1 << '\n';
            update(0, l-1, 1);
        }
        else
        {
            int r = highest(k-1);
            update(tin[r], tin[r], 0);
            cout << L[k-1] - L[r] << '\n';
        }
    }

    return 0;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 2396 KB Time limit exceeded
2 Execution timed out 1054 ms 3420 KB Time limit exceeded
3 Execution timed out 1041 ms 3416 KB Time limit exceeded
4 Execution timed out 1041 ms 2396 KB Time limit exceeded
5 Execution timed out 1063 ms 2396 KB Time limit exceeded
6 Execution timed out 1062 ms 2396 KB Time limit exceeded
7 Execution timed out 1027 ms 2652 KB Time limit exceeded
8 Execution timed out 1058 ms 2652 KB Time limit exceeded
9 Execution timed out 1047 ms 2652 KB Time limit exceeded
10 Execution timed out 1064 ms 2908 KB Time limit exceeded
11 Execution timed out 1067 ms 3676 KB Time limit exceeded
12 Execution timed out 1063 ms 3420 KB Time limit exceeded
13 Execution timed out 1059 ms 3420 KB Time limit exceeded

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1036 ms 3928 KB Time limit exceeded
2 Execution timed out 1068 ms 7260 KB Time limit exceeded
3 Execution timed out 1040 ms 3932 KB Time limit exceeded
4 Execution timed out 1071 ms 3932 KB Time limit exceeded
5 Execution timed out 1046 ms 3932 KB Time limit exceeded
6 Execution timed out 1036 ms 3928 KB Time limit exceeded
7 Execution timed out 1055 ms 3420 KB Time limit exceeded
8 Execution timed out 1045 ms 3932 KB Time limit exceeded
9 Execution timed out 1039 ms 7256 KB Time limit exceeded
10 Execution timed out 1047 ms 7256 KB Time limit exceeded
11 Execution timed out 1070 ms 7260 KB Time limit exceeded
12 Execution timed out 1065 ms 5724 KB Time limit exceeded
13 Execution timed out 1050 ms 9308 KB Time limit exceeded
14 Execution timed out 1018 ms 3928 KB Time limit exceeded

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 4956 KB Time limit exceeded
2 Execution timed out 1022 ms 5668 KB Time limit exceeded
3 Execution timed out 1068 ms 8796 KB Time limit exceeded
4 Execution timed out 1056 ms 6236 KB Time limit exceeded
5 Execution timed out 1045 ms 6232 KB Time limit exceeded
6 Execution timed out 1022 ms 6232 KB Time limit exceeded
7 Execution timed out 1100 ms 4952 KB Time limit exceeded
8 Execution timed out 1038 ms 8792 KB Time limit exceeded
9 Execution timed out 1090 ms 7256 KB Time limit exceeded
10 Execution timed out 1055 ms 7260 KB Time limit exceeded
11 Execution timed out 1059 ms 7260 KB Time limit exceeded
12 Execution timed out 1006 ms 5720 KB Time limit exceeded
13 Execution timed out 1064 ms 10332 KB Time limit exceeded
14 Execution timed out 1045 ms 3928 KB Time limit exceeded

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1034 ms 7256 KB Time limit exceeded
2 Execution timed out 1066 ms 5724 KB Time limit exceeded
3 Execution timed out 1044 ms 10328 KB Time limit exceeded
4 Execution timed out 1038 ms 7260 KB Time limit exceeded
5 Execution timed out 1046 ms 7260 KB Time limit exceeded
6 Execution timed out 1081 ms 7348 KB Time limit exceeded
7 Execution timed out 1035 ms 5720 KB Time limit exceeded
8 Execution timed out 1060 ms 10488 KB Time limit exceeded
9 Execution timed out 1043 ms 3932 KB Time limit exceeded