Submission #993958

#	Time	Username	Problem	Language	Result	Execution time	Memory
993958		aaaaaarroz	Beech Tree (IOI23_beechtree)	C++17	5 / 100	110 ms	13740 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;
typedef pair<int, int> pii;
const int N = 2e5 + 1;

vector<int> beechtree(int n, int m, vector<int> P, vector<int> C)
{
    set<int> was = {C[n - 1]};
    vector<int> ans = {1, 1};

    bool same = true;
    for (int i = n - 2; i > 0; --i)
    {
        same &= was.count(C[i]);
        ans.push_back(same);
        was.insert(C[i]);
    }
    reverse(all(ans));

    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