제출 #1217926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1217926		_callmelucian	Burza (COCI16_burza)	C++17	0 / 160	1096 ms	324 KiB

burza

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

using ll = long long;
using ld = long double;
using pl = pair<ll,ll>;
using pii = pair<int,int>;
using tpl = tuple<int,int,int>;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

vector<int> adj[404], leaf(1);
int up[404][11], depth[404], leftMost[404], n, k, leafCnt;
bool dp[404][11], pick[404];

void dfs (int u, int p, int d) {
    up[u][0] = p, depth[u] = d;
    for (int i = 1; i < 11; i++)
        up[u][i] = up[up[u][i - 1]][i - 1];
    if (depth[u] == k) { // cut the tree at this point
        leftMost[u] = ++leafCnt, pick[u] = 1;
        leaf.push_back(u);
        return;
    }

    leftMost[u] = INT_MAX;
    for (int v : adj[u]) {
        if (v == p) continue;
        dfs(v, u, d + 1);
        if (pick[v]) {
            leftMost[u] = min(leftMost[u], leftMost[v]);
            pick[u] = 1;
        }
    }
}

int goUp (int a, int k) {
    for (int i = 0; k; k >>= 1, i++)
        if (k & 1) a = up[a][i];
    return a;
}

bool getCur (int mask, int pos) { return mask >> pos & 1; }

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k;
    for (int i = 1; i < n; i++) {
        int a, b; cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    dfs(1, 1, 0);
    if (!leafCnt || k > 10) {
        while (true);
        return cout << "DA\n", 0;
    }

    fill(dp[0], dp[0] + (1 << k), 1);
    for (int i = 1; i <= leafCnt; i++) {
        for (int mask = 0; mask < (1 << k); mask++) {
            for (int jump = 0; jump < k; jump++) {
                if (!getCur(mask, jump)) continue;
                int lc = goUp(leaf[i], jump);
                if (dp[leftMost[lc] - 1][mask ^ (1 << jump)]) {
                    dp[i][mask] = 1;
                    break;
                }
            }
        }
    }
    cout << (dp[leafCnt][(1 << k) - 1] ? "DA" : "NE") << "\n";

    return 0;
}

• 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