Submission #1046480

#	Time	Username	Problem	Language	Result	Execution time	Memory
1046480		Trustfulcomic	Beech Tree (IOI23_beechtree)	C++17	5 / 100	34 ms	4188 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> res(N, 0);
    res[N-1] = 1;
    for (int i = N-2; i >= 0; i--){
        if (C[i+1] != C[N-1]) break;
        res[i] = 1;
    }

    return res;
}

• 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