Submission #980910

#	Time	Username	Problem	Language	Result	Execution time	Memory
980910		vjudge1	Beech Tree (IOI23_beechtree)	C++17	5 / 100	61 ms	4312 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>

#define range(it, a, b) for (ll it = a; it < b; it++)
#define all(x) begin(x), end(x)
#define ll long long
#define ull unsigned long long
#define INF64 ((ll) 1 << 62)
#define INF32 (1 << 30)
#define mset multiset
#define uset unordered_set
#define umap unordered_map 
#define pqueue priority_queue 
#define ptr(A) shared_ptr<A>

using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    vector<int> ans (N);

    bool is = 1;
    int color = -1;
    for (int i = N-1; i >= 0; i--) {
        if (i == N-1) {
            ans[i] = 1;
            color = C[i];
            continue;
        }

        ans[i] = is;

        if (C[i] != color)
            is = 0;
    }
    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