Submission #1083405

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083405		steveonalex	Ball Machine (BOI13_ballmachine)	C++17	100 / 100	216 ms	29264 KiB

ballmachine

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct FenwickTree{
    int n;
    vector<int> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n+1);
    }

    void update(int i, int v){
        while(i <= n){
            a[i] += v;
            i += LASTBIT(i);
        }
    }

    void update(int l, int r, int v){
        update(l, v); update(r + 1, -v);
    }

    int get(int i){
        int ans = 0;
        while(i > 0){
            ans += a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }
};

const int N = 1e5 + 69, LOG_N = 17;
int n, q;
vector<int> graph[N];
int h[N], parent[N][LOG_N];
int mi[N];

int l[N], r[N], dfs_cnt = 0;
int topo[N], topo_cnt = 0;

void dfs(int u, int p){
    h[u] = h[p] + 1;
    mi[u] = u;
    for(int j = 1; MASK(j) < h[u]; ++j) 
        parent[u][j] = parent[parent[u][j-1]][j-1];
    for(int v: graph[u]) if (v != p){
        parent[v][0] = u;
        dfs(v, u);
        minimize(mi[u], mi[v]);
    }
}

void get_topo(int u, int p){
    l[u] = r[u] = ++dfs_cnt;
    sort(ALL(graph[u]), [] (int x, int y){
        return mi[x] < mi[y];
    });

    for(int v: graph[u]) if (v != p){
        get_topo(v, u);
        r[u] = r[v];
    }

    topo[u] = ++topo_cnt;
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    cin >> n >> q;
    int root = 0;
    for(int i= 1; i<=n; ++i){
        int p; cin >> p;
        if (p != 0){
            graph[p].push_back(i);
            graph[i].push_back(p);
        }
        else root = i;
    }

    dfs(root, 0);
    get_topo(root, 0);

    set<pair<int, int>> missing;
    for(int i = 1; i<=n; ++i) missing.insert({topo[i], i});

    FenwickTree bit(n);
    for(int i = 1; i<=n; ++i) bit.update(l[i], r[i], 1);

    while(q--){
        int type; cin >> type;
        if (type == 1){
            int k; cin >> k;
            while(k--){
                pair<int, int> cu = *missing.begin();
                missing.erase(cu);
                bit.update(l[cu.second], r[cu.second], -1);
                if (k == 0) cout << cu.second << "\n";
            }
        }
        else{
            int x; cin >> x;
            int cu = bit.get(l[x]);
            int ans = 0;
            for(int j = LOG_N - 1; j >= 0; --j) if (MASK(j) < h[x]){
                int y = parent[x][j];
                int _cu = bit.get(l[parent[y][0]]);
                if (cu == _cu){
                    x = y;
                    ans += MASK(j);
                }
            }
            bit.update(l[x], r[x], 1);
            missing.insert({topo[x], x});
            cout << ans << "\n";
        }
    }


    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 30 / 30
• Subtask 3: 40 / 40
• Subtask 4: 5 / 5