제출 #852140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
852140		overwatch9	Burza (COCI16_burza)	C++17	0 / 160	1068 ms	860 KiB

burza

#include <iostream>
#include <vector>
using namespace std;
int n, k;
vector <vector <int>> adj;
vector <int> depth;
const int maxn = 400 + 1;
bool dp[maxn][maxn];
bool ready[maxn][maxn];
void get_depth(int s, int p, int d) {
    depth[s] = d;
    if (d == k) {
        ready[s][d] = true;
        dp[s][d] = false;
        return;
    }
    if (adj[s].size() == 1 && s != p) {
        // if we reach this node, then we can win
        ready[s][d] = true;
        dp[s][d] = true;
        return;
    }
    for (auto i : adj[s]) {
        if (i == p)
            continue;
        get_depth(i, p, d+1);
    }
}
bool solve(int s, int p) {
    if (ready[s][depth[s]])
        return dp[s][depth[s]];
    int false_dps = 0;
    int true_dps = 0;
    for (auto i : adj[s]) {
        if (i == p)
            continue;
        if (solve(i, s))
            true_dps++;
        else
            false_dps++;
    }
    if (true_dps > 0)
        return true;
    else if (false_dps == 1)
        return true;
    return false;
}
int main() {
    cin >> n >> k;
    adj.resize(n+1);
    depth.resize(n+1);
    for (int i = 0; i < n-1; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    get_depth(1, 1, 0);
    if (solve(1, 1))
        cout << "DA\n";
    else
        cout << "NE\n";
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 16
• Subtask 3: 0 / 16
• Subtask 4: 0 / 16
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 16
• Subtask 8: 0 / 16
• Subtask 9: 0 / 16
• Subtask 10: 0 / 16