Submission #862902

#	Time	Username	Problem	Language	Result	Execution time	Memory
862902		faustaadp	Beech Tree (IOI23_beechtree)	C++17	5 / 100	58 ms	6256 KiB

beechtree

#include "beechtree.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    vector<int> ret(N, 0);
    ll lst = C[N - 1];
    ret[N - 1] = 1;
    for(ll i = N - 2; i >= 0; i--)
        if(C[i + 1] == lst)
            ret[i] = 1;
        else
            break;
    return ret;
}

• 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