Submission #1211234

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211234		omsincoconut	Beech Tree (IOI23_beechtree)	C++17	5 / 100	89 ms	11336 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) {
    vector<int> ret(N);
    ret[N-1] = 1;
    set<int> df;
    for (int i = N-2; i >= 0; i--) {
        df.insert(C[i+1]);
        ret[i] = df.size()==1;
    }
    return ret;
}

• 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