Submission #847663

#	Time	Username	Problem	Language	Result	Execution time	Memory
847663		vjudge1	Beech Tree (IOI23_beechtree)	C++17	0 / 100	1 ms	344 KiB

beechtree

#include "beechtree.h"

#include <bits/stdc++.h>
using namespace std;

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C) {
        vector<int> f(N, 0);
        int x = C[--N];
        f[N] = 1;
        while (N >= 0 && C[N] == x) {
                f[N--] = 1;
        }
        return f;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 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