Submission #73123

#	Time	Username	Problem	Language	Result	Execution time	Memory
73123		bharat2002	Ball Machine (BOI13_ballmachine)	C++14	100 / 100	527 ms	42464 KiB

ballmachine

/*input
8 4
0
1
2
2
3
3
4
6
1 8
2 5
2 7
2 8
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define f first
#define s second
inline pii mp(int a, int b)
{
	pii temp;temp.f=a;temp.s=b;return temp;
}
int n, q;vector<int> adjlist[100001];
int root;
int parent[100001][20], mval[100001];
void dfs(int i)
{
	mval[i]=i;
	for(auto j:adjlist[i])
	{
		dfs(j);mval[i]=min(mval[i], mval[j]);
	}
}
int cur, val[100001];bool done[100001];
void dfs2(int i)
{
	for(auto j:adjlist[i])
	{
		dfs2(j);
	}
	val[i]=cur++;
}
struct comp
{
	bool operator() (const int &a, const int &b)
	{
		return val[b]<val[a];
	}
};
priority_queue<int, vector<int>, comp > pq;
bool sf(int a, int b)
{
	return mval[a]<mval[b];
}
signed main()
{
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	cin>>n>>q;
	for(int i=1;i<=n;i++)
	{
		int f;cin>>f;
		if(f==0) {root=i;}
		else {adjlist[f].push_back(i);}
		parent[i][0]=f;
	}
	for(int j=1;j<20;j++)
	{
		for(int i=1;i<=n;i++)
		{
			parent[i][j]=parent[parent[i][j-1]][j-1];
		}
	}
	dfs(root);
	for(int i=1;i<=n;i++)
	{
		sort(adjlist[i].begin(), adjlist[i].end(), sf);
	}
	cur=1;dfs2(root);
	for(int i=1;i<=n;i++)
	{
		pq.push(i);
	}
	while(q--)
	{
		int t, k;cin>>t>>k;
		if(t==1)
		{
			int ans;
			while(k--)
			{
				ans=pq.top();done[ans]=1;pq.pop();
			}
			cout<<ans<<endl;
		}
		else
		{
			int ans=0;
			int j=19;
			while(j>=0)
			{
				if(done[parent[k][j]]) {k=parent[k][j];ans+=(1<<j);}
				j--;
			}
//			ans++;
			done[k]=0;cout<<ans<<endl;pq.push(k);
		}
	}
}

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