Submission #98532

#	Time	Username	Problem	Language	Result	Execution time	Memory
98532		dalgerok	Burza (COCI16_burza)	C++17	160 / 160	70 ms	984 KiB

burza

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


const int M = 405, N = 20;




int n, k, d[M];
int tin[M], tout[M], timer;
vector < int > g[M], q[M];
bitset < (1 << N) > dp[M];

void dfs(int v, int pr = -1){
    if(d[v] == k){
        tin[v] = timer++;
        tout[v] = timer;
        return;
    }
    tin[v] = timer;
    for(int to : g[v]){
        if(to != pr){
            d[to] = d[v] + 1;
            dfs(to, v);
        }
    }
    tout[v] = timer;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> k;
    if(k * k >= n){
        return cout << "DA", 0;
    }
    for(int i = 1; i < n; i++){
        int x, y;
        cin >> x >> y;
        x -= 1;
        y -= 1;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(0);
    for(int i = 0; i < n; i++){
        if(d[i] == 0){
            continue;
        }
        d[i] -= 1;
        q[tin[i]].push_back(i);
    }
    dp[0][0] = true;
    for(int i = 0; i < timer; i++){
        for(int j = 0; j < (1 << k); j++){
            if(dp[i][j] == true){
                for(auto it : q[i]){
                    if(!((j >> d[it]) & 1)){
                        dp[tout[it]][j | (1 << d[it])] = true;
                    }
                }
            }
        }
    }
    for(int i = 0; i < (1 << k); i++){
        if(dp[timer][i] == true){
            return cout << "DA", 0;
        }
    }
    cout << "NE";
}

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