Submission #912602

#	Time	Username	Problem	Language	Result	Execution time	Memory
912602		Ludissey	Beech Tree (IOI23_beechtree)	C++17	5 / 100	61 ms	20152 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
int N,M;
vector<vector<int>> child;
vector<int> C;
vector<int> P;
vector<int> outp;


std::vector<int> beechtree(int n, int m, std::vector<int> p, std::vector<int> c)
{
    N=n; M=m;
    C.assign(c.begin(), c.end());
    P.assign(p.begin(), p.end());
    child.resize(n);
    outp.resize(n,0);
    for (int i = 1; i < N; i++) child[P[i]].push_back(i);
    outp[n-1]=1;
    if(n>1) outp[n-2]=1;
    for (int i = n-3; i >= 0; i--)
    {
        if(c[i+1]!=c[i+2]) return {outp};
        outp[i]=1;
    }
    return {outp};
}

• 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