Submission #1038999

#	Time	Username	Problem	Language	Result	Execution time	Memory
1038999		Zicrus	Beech Tree (IOI23_beechtree)	C++17	5 / 100	44 ms	6860 KiB

beechtree

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

typedef long long ll;

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) {
    vector<int> res(n);
    bool works = true;
    for (int i = n-1; i >= 0; i--) {
        res[i] = works;
        if (c[i] != c.back()) works = false;
    }
    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