Submission #783034

#	Time	Username	Problem	Language	Result	Execution time	Memory
783034		Ahmed57	Burza (COCI16_burza)	C++17	0 / 160	259 ms	524288 KiB

burza

#include<bits/stdc++.h>

using namespace std;
vector<int> eu;int en[401],lol[401];
vector<int> adj[401];
void dfs(int i,int pr,int dep){
    eu.push_back(i);
    lol[i] = dep;
    for(auto j:adj[i]){
        if(j==pr)continue;
        dfs(j,i,dep+1);
    }
    en[i] = eu.size();
}
int dp[401][(1<<20)];int n,k;
int solve(int i,int mask){
    if(i==n){
        return 1;
    }
    if(dp[i][mask]!=-1)return dp[i][mask];
    int c1 = 0;
    if(!(mask&(1<<lol[eu[i]]))){
        c1|=solve(en[eu[i]],mask|(1<<lol[eu[i]]));
    }
    if(lol[eu[i]]+1<k){
        c1|=solve(i+1,mask);
    }
    return dp[i][mask] = c1;
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>k;
    if(n<=k*k){
        cout<<"DA\n";
        return 0;
    }
    for(int i = 0;i<n-1;i++){
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    dfs(1,0,-1);
    memset(dp,-1,sizeof dp);
    cout<<(solve(1,0)?"DA":"NE")<<endl;
    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