Submission #1008598

#	Time	Username	Problem	Language	Result	Execution time	Memory
1008598		aaaaaarroz	Beech Tree (IOI23_beechtree)	C++17	5 / 100	112 ms	13744 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> beechtree(int n, int m, vector<int>P, vector<int>C){
	set<int>vistos;
	vistos.insert(C[n-1]);
	vector<int>ans={1, 1};
	bool sigue_siendo_el_mismo=true;
	for (int i=n-2;i>0;i--){
		sigue_siendo_el_mismo&=vistos.count(C[i]);
		ans.push_back(sigue_siendo_el_mismo);
		vistos.insert(C[i]);
	}
	reverse(ans.begin(),ans.end());
	return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 5 / 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