Submission #880090

#	Time	Username	Problem	Language	Result	Execution time	Memory
880090		anton	Burza (COCI16_burza)	C++17	0 / 160	1 ms	348 KiB

burza

#include<bits/stdc++.h>

using namespace std;

vector<vector<int>> adj;
vector<vector<int>> ch;

void dfs(int u, int anc){
    for(auto v:adj[u]){
        if(v!=anc){
            ch[u].push_back(v);
            dfs(v, u);
        }
    }
}

int dp(int u){
    int best = -1;
    int s_best = -1;

    for(auto e: ch[u]){
        auto cur = dp(e);
        if(cur>=best){
            s_best = best;
            best = cur;
        }
        else if(cur>=s_best){
            s_best = cur;
        }
    }

    return s_best+1;
}
signed main(){
    int n,k;
    cin>>n>>k;

    adj.resize(n);
    ch.resize(n);

    for(int i =0; i<n-1; i++){
        int a, b;
        cin>>a>>b;
        a--;
        b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    dfs(0, -1);

    int res = dp(0);
    //cout<<res<<endl;
    if(k>res){
        cout<<"DA"<<endl;
    }
    else{
        cout<<"NE"<<endl;
    }

}

• 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