Submission #646013

#	Time	Username	Problem	Language	Result	Execution time	Memory
646013		Karuk	Burza (COCI16_burza)	C++14	0 / 160	1 ms	312 KiB

burza

#include<bits/stdc++.h>
using namespace std;
int n,k;
bool flag[401];
bool used[401];
vector<int>a[401];
void dfs(int n,int depth=0) {
    used[n]=1;
    if(depth==k){flag[n]=1;return;}
    int cnt=0;
    for(int i:a[n]) {
        if(!used[i]){dfs(i,depth+1);cnt+=flag[i];}
    }
    if(cnt>1)flag[n]=1;
}
int main() {
    cin>>n>>k;
    for(int i=0;i<n-1;i++) {
        int x,y;cin>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    dfs(1);
    if(flag[1])cout<<"NE"<<endl;
    else cout<<"DA"<<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