Submission #846064

#	Time	Username	Problem	Language	Result	Execution time	Memory
846064		Lib	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2 ms	4700 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
vector <vector <int> > child;
int par[200003];
int color[200003];
int ok[200003];
vector<int> beechtree(int n, int m, vector<int> P, vector<int> C)
{
   vector <int> temp;
	for(int i=0;i<=n+1;i++){
		child.push_back(temp);
	}
	for(int i=1;i<=n;i++){
		par[i]=P[i-1];
		color[i]=C[i-1];
		child[par[i]].push_back(i);
	}
	ok[n-1]=1;
	ok[n-2]=1;
	for(int i=n-3;i>0;i--){
		if(color[i]==color[i+1]){
			ok[i]=1;
		}else{
			break;
		}
	}
    vector<int> ans(n, 0);
    for (int i = 0; i < n; ++i)
    {
        ans[i] = ok[i];
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 5
• Subtask 3: 0 / 9
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12