Submission #1109923

#	Time	Username	Problem	Language	Result	Execution time	Memory
1109923		12345678	Burza (COCI16_burza)	C++17	0 / 160	1 ms	508 KiB

burza

#include <bits/stdc++.h>

using namespace std;

const int nx=405;

int n, k, u, v, dp[10005], lvl[nx], c[nx], t, l[nx], r[nx];
vector<int> d[nx], dpt[nx];

void dfs(int u, int p)
{
    lvl[u]=lvl[p]+1;
    l[u]=n;
    if (lvl[u]==k-1) return l[u]=r[u]=++t, c[u]=1, dpt[lvl[u]].push_back(u), void();
    for (auto v:d[u]) if (v!=p) dfs(v, u), c[u]=c[u]||c[v], l[u]=min(l[u], l[v]), r[u]=max(r[u], r[v]);
    if (c[u]&&u!=1) dpt[lvl[u]].push_back(u);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<n; i++) cin>>u>>v, d[u].push_back(v), d[v].push_back(u);
    if (n<(1<<(k+1))-1) return cout<<"DA", 0;
    lvl[1]=-2;
    dfs(1, 1);
    for (int msk=1; msk<(1<<k); msk++)
    {
        for (int i=0; i<k; i++) if (msk&(1<<i)) for (auto u:dpt[i]) if (dp[msk^(1<<i)]+1>=l[u]) dp[msk]=max({dp[msk], r[u]});
        //cout<<"debug "<<msk<<' '<<dp[msk]<<'\n';
        if (dp[msk]==t) return cout<<"DA", 0;
    }
    
    cout<<"NE";
}

• 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