Submission #1222085

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222085		thelegendary08	Beech Tree (IOI23_beechtree)	C++17	5 / 100	42 ms	4272 KiB

beechtree

#include "beechtree.h"
#include<bits/stdc++.h>
#define int long long
#define f0r(i,n) for(int i = 0; i<n; i++)
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define vpii vector<pii>
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define vb vector<bool>
using namespace std;
std::vector<signed> beechtree(signed N, signed M, std::vector<signed> P, std::vector<signed> C)
{
	set<int>s;
	vector<signed>ans(N);
	ans[N-1] = 1;
	for(int i = N-1; i>0; i--){
		s.insert(C[i]);
		if(s.size() == 1)ans[i-1] = 1;
		else break;
	}
    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