제출 #1103527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103527		dead0ne	Burza (COCI16_burza)	C++17	0 / 160	1 ms	340 KiB

burza

#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define int long long
#define ii pair<long long,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define mid (l+r)/2
#define inf 1e15
#define MOD 1000000007
#define MX 405
using namespace std;

vi edges[MX];
int maxi[MX];
void dfs(int node, int par){
    maxi[node]=0;
    if(edges[node].size()-(node!=1)<=1) return;
    vi chi;
    for(auto i:edges[node]){
        if(i!=par){
            dfs(i, node);
            chi.pb(maxi[i]);
        }
    }
    sort(all(chi));
    maxi[node]=chi[chi.size()-2]+1;
}

void solve(){
    int n, k; cin >> n >> k;
    for(int i=1; i<n; i++){
        int a,b; cin >> a >> b;
        edges[a].pb(b);
        edges[b].pb(a);
    }
    dfs(1, 0);
    if(maxi[1]+1<=k){
        cout << "DA\n";
    }
    else cout << "NE\n";
}

 
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    #ifdef Local
    freopen("in","r",stdin);
    freopen("out","w",stdout);
    #endif
 
    /*freopen(".in","r",stdin);
    freopen(".out","w",stdout);*/

    int t=1;
    //cin >> t;
    while(t--) solve();
}

• 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