Submission #1038816

#	Time	Username	Problem	Language	Result	Execution time	Memory
1038816		fv3	Beech Tree (IOI23_beechtree)	C++17	5 / 100	44 ms	6748 KiB

beechtree

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

using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C)
{
    vector<int> b(N);
    b.back() = 1;
    for (int i = N - 2; i >= 0; i--)
    {
        if (C[i+1] != C.back()) break;
        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