제출 #674535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
674535		Nicolas125841	Burza (COCI16_burza)	C++14	0 / 160	1 ms	344 KiB

burza

#include <bits/stdc++.h>

using namespace std;

#define YES "DA"
#define NO "NE"

int dfs(vector<vector<int>> &mp, int n, int p, int m){
    if(mp[n].size() == 1 && mp[n][0] == p)
        return m+1;
    else{
        vector<int> ans;

        for(int v : mp[n])
            if(v != p)
                ans.push_back(dfs(mp, v, n, m+1));

        sort(ans.begin(), ans.end());

        if(ans.size() == 1)
            return m+1;
        else
            return ans[ans.size()-2];
    }
}

int main(){
    cin.tie(NULL)->sync_with_stdio(false);

    int n, k;
    cin >> n >> k;

    vector<vector<int>> mp(n, vector<int>());

    for(int i = 0; i < n-1; i++){

        int u, v;
        cin >> u >> v;

        mp[--u].push_back(--v);
        mp[v].push_back(u);

    }

    cout << (dfs(mp, 0, -1, 0) <= k ? YES : NO) << "\n";
}

• 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