Submission #1220399

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220399		trimkus	Beech Tree (IOI23_beechtree)	C++20	5 / 100	40 ms	4168 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);
    res[N - 1] = 1;
    for (int i = N - 2; i >= 0; --i) {
        // cerr << C[i + 1] << " " << C[i] << "\n";
        res[i] = 1;
        if (C[i + 1] != C[i]) {
            break;
        }
    }
    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