Submission #1047069

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047069		Abito	Beech Tree (IOI23_beechtree)	C++17	5 / 100	61 ms	9052 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int a[N],c[N],p[N],n;
vector<int> beechtree(int N, int M, vector<int> P, vector<int> C)
{
    n=N;
    vector<int> ans(n,0);
    for (int i=0;i<n;i++) p[i]=P[i],c[i]=C[i];
    for (int i=n-1;i>=0;i--){
        ans[i]=1;
        if (c[i]!=c[n-1]) 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