제출 #1132838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1132838		SpyrosAliv	Beech Tree (IOI23_beechtree)	C++20	5 / 100	50 ms	16048 KiB

beechtree

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

int n, m;
vector<vector<int>> tree;
vector<int> c;

vector<int> solve_line() {
    vector<int> ans(n, false);
    ans[n-1] = true;
    for (int i = n-1; i >= 1; i--) {
        if (c[i] != c[n-1]) {
            break;
        }
        ans[i-1] = true;
    }
    return ans;
}

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    n = N;
    m = M;
    c = C;
    tree.clear();
    tree.resize(n);
    bool line = true;
    for (int i = 1; i < n; i++) {
        tree[P[i]].push_back(i);
        if (P[i] != i-1) line = false;
    }
    if (line) return solve_line();
    vector<int> ans(n, 0);
    return ans;
}
/*
int main() {
    vector<int> f = beechtree(5, 4, {-1, 0, 1, 2, 3, 4}, {0, 0, 1, 1, 1, 1});
    for (auto x: f) cout << x << " ";
    cout << '\n';
}*/

• 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