제출 #1230725

#제출 시각아이디문제언어결과실행 시간메모리
1230725Double_SlashBurza (COCI16_burza)C++20
0 / 160
0 ms328 KiB
#include <bits/stdc++.h>

using namespace std;

int n, k;
vector<int> adj[401];

int dfs(int i, int p = 0) {
    int mx[2]{};
    for (int j: adj[i]) {
        if (j == p) continue;
        mx[1] = max(mx[1], dfs(j, i));
        if (mx[1] > mx[0]) swap(mx[0], mx[1]);
    }
    return mx[1] + 1;
}

int main() {
    cin >> n >> k;
    for (int i = n; --i;) {
        int a, b;
        cin >> a >> b;
        adj[a].emplace_back(b);
        adj[b].emplace_back(a);
    }
    cout << (dfs(1) <= k ? "DA" : "NE");
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...