제출 #848115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
848115		math_rabbit_1028	Beech Tree (IOI23_beechtree)	C++17	0 / 100	2 ms	4952 KiB

beechtree

#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int n, m;
vector<int> p, c;
vector<int> adj[202020];

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    n = N; m = M; p = P; c = C;
    for (int i = 0; i < n; i++) {
        adj[p[i]].push_back(i);
    }

    vector<int> res(n);
    int ans = 1;
    for (int i = n - 1; i >= 1; i--) {
        res[i] = ans;
        if (c[i] != c[n - 1]) ans = 0;
    }
    return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 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