Submission #1247626

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247626		12baater	Beech Tree (IOI23_beechtree)	C++20	5 / 100	39 ms	4168 KiB

beechtree

#include "beechtree.h"
#include <vector>
using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C)
{
    bool all_same = 1;
    int color = C[N-1];
    vector<int> ans(N);
    ans[N-1] = 1;
    for (int i = N-1; i > 0; i--) {
        if (all_same == 0) {
            ans[i-1] = 0;
        } else {
            if (C[i] == color) {
                ans[i-1] = 1;
            } else {
                all_same = 0;
                ans[i-1] = 0;
            }
        }
    }

    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