Submission #699734

#	Time	Username	Problem	Language	Result	Execution time	Memory
699734		finn__	Ball Machine (BOI13_ballmachine)	C++17	66.29 / 100	133 ms	53356 KiB

ballmachine

#include <bits/stdc++.h>
using namespace std;

#define N 100000

vector<unsigned> g[N], anc[N];
unsigned min_child[N], postorder[N];
bitset<N> has_ball;

unsigned calc_min_child(unsigned u)
{
    min_child[u] = u;
    for (unsigned const &v : g[u])
        min_child[u] = min(min_child[u], calc_min_child(v));
    return min_child[u];
}

unsigned traverse(unsigned u, vector<unsigned> &path, unsigned i = 0)
{
    for (size_t j = 1; j <= path.size(); j <<= 1)
        anc[u].push_back(path[path.size() - j]);
    path.push_back(u);

    for (unsigned const &v : g[u])
        i = traverse(v, path, i);

    path.pop_back();
    postorder[u] = i++;
    return i;
}

int main()
{
    size_t n, q;
    scanf("%zu %zu", &n, &q);
    unsigned r;

    for (size_t i = 0; i < n; i++)
    {
        unsigned p;
        scanf("%u", &p);
        if (!p)
            r = i;
        else
            g[p - 1].push_back(i);
    }

    calc_min_child(r);
    for (size_t i = 0; i < n; i++)
        sort(g[i].begin(), g[i].end(), [&](unsigned a, unsigned b)
             { return min_child[a] < min_child[b]; });

    vector<unsigned> path;
    assert(traverse(r, path) == n);

    priority_queue<pair<unsigned, unsigned>> qu;
    for (unsigned i = 0; i < n; i++)
        qu.emplace(n - postorder[i], i);

    while (q--)
    {
        unsigned t, x;
        scanf("%u %u", &t, &x);

        if (t == 1)
        {
            for (size_t i = 0; i < x; i++)
            {
                if (i + 1 == x)
                    printf("%u\n", qu.top().second + 1);
                has_ball[qu.top().second] = 1;
                qu.pop();
            }
        }
        else
        {
            x--;
            assert(has_ball[x]);
            unsigned h = 0;

            for (size_t i = anc[x].size() - 1; i < anc[x].size(); i--)
                if (has_ball[anc[x][i]])
                    x = anc[x][i], h += 1U << i;

            has_ball[x] = 0;
            qu.emplace(n - postorder[x], x);
            printf("%u\n", h);
        }
    }
}

Compilation message (stderr)

ballmachine.cpp: In function 'int main()':
ballmachine.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     scanf("%zu %zu", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
ballmachine.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         scanf("%u", &p);
      |         ~~~~~^~~~~~~~~~
ballmachine.cpp:63:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         scanf("%u %u", &t, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~
ballmachine.cpp:54:20: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   54 |     assert(traverse(r, path) == n);
      |                    ^

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