제출 #843315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
843315		SHZhang	Beech Tree (IOI23_beechtree)	C++17	5 / 100	58 ms	19912 KiB

beechtree

#include "beechtree.h"

#include <vector>
#include <utility>
using namespace std;
int n, m;
vector<int> p, c;
vector<pair<int, int>> children[200005];
bool chain[200005];
int purecolor[200005];

int perms[15];

bool check(int i)
{
    if (chain[i]) {
        return purecolor[i] != -1;
    } else {
        return false;
    }
}

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    n = N; m = M; p = P; c = C;
    vector<int> ans;
    bool ischain = true;
    for (int i = 1; i < N; i++) {
        if (P[i] != i-1) ischain = false;
        children[P[i]].push_back(make_pair(i, C[i]));
    }
    if (ischain) {
        int last = N - 1;
        while (last >= 1 && C[last] == C[N-1]) last--;
        vector<int> ans;
        for (int i = 0; i < last; i++) ans.push_back(0);
        for (int i = 0; i < n - last; i++) ans.push_back(1);
        return ans;
    }
    for (int i = 0; i < N; i++) {
        if (check(i)) ans.push_back(1);
        else ans.push_back(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