# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923783 | n3rm1n | Ball Machine (BOI13_ballmachine) | C++17 | 54 ms | 12920 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 1e5 + 10;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int n, que;
int p[MAXN], root;
vector < int > g[MAXN];
void read()
{
cin >> n >> que;
for (int i = 1; i <= n; ++ i)
{
cin >> p[i];
if(!p[i])root = i;
else g[p[i]].push_back(i);
}
}
int points[MAXN], cnt;
void dfs0(int beg)
{
int nb;
for (int i = 0; i < g[beg].size(); ++ i)
{
nb = g[beg][i];
dfs0(nb);
}
cnt ++;
points[beg] = cnt;
}
int used[MAXN];
priority_queue < pair < int, int > > q;
int query_type1(int x)
{
int v = 0;
while(x --)
{
v = q.top().second;
//cout << v << endl;
used[-v] = 1;
q.pop();
}
return -v;
}
int main()
{
speed();
read();
dfs0(root);
for (int i = 1; i <= n; ++ i)
q.push(make_pair(-points[i], -i));
int t, x;
while(que --)
{
cin >> t >> x;
if(t == 1)
cout << query_type1(x) << endl;
else
{
q.push(make_pair(-points[x], -x));
used[x] = 0;
cout << 0 << endl;
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |