Submission #841424

#	Time	Username	Problem	Language	Result	Execution time	Memory
841424		model_code	Beech Tree (IOI23_beechtree)	C++17	5 / 100	67 ms	6308 KiB

beechtree

// correct/subtask-line.cpp

#include "beechtree.h"

using namespace std;

vector<int> beechtree(int N, int /*M*/, vector<int> /*P*/, vector<int> C)
{
    vector<int> t(N, 1);
    bool ok = true;
    for (int v = N - 2; v >= 0; --v)
    {
        t[v] = ok;
        if (C[v] != C[v + 1])
            ok = false;
    }
    return t;
}

• 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