Submission #1065504

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065504		cpdreamer	Beech Tree (IOI23_beechtree)	C++17	5 / 100	96 ms	13652 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define V vector
using namespace std;
std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    V<int>b(N);
    set<int>st;
    b[N-1]=1;
    for(int i=N-2;i>=0;i--){
        st.insert(C[i+1]);
        if(st.size()>1)
            b[i]=0;
        else
            b[i]=1;
    }
    return b;
}

• 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