Submission #1242464

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242464		bangan	Beech Tree (IOI23_beechtree)	C++20	5 / 100	39 ms	4268 KiB

beechtree

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

#define pb push_back
#define ALL(a) a.begin(), a.end()

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) {
    int col = c[n-1];
    vector<int> ans(n);
    for (int i = n-1; 0<=i; i--) {
        ans[i] = 1;
        if (c[i] != col) break;
    }
    return ans;
}

• 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