Submission #714993

#TimeUsernameProblemLanguageResultExecution timeMemory
714993egregiousBurza (COCI16_burza)C++14
0 / 160
3 ms312 KiB
#include <bits/stdc++.h> using namespace std; const int N = 400; int n, k; vector<int> adj[N + 1]; int dp(int x, int p) { int mx1 = -1, mx2 = -1; for (int y : adj[x]) { if (y == p) continue; int res = dp(y, x); if (res > mx1) mx2 = mx1, mx1 = res; else if (res > mx2) mx2 = res; } return mx2 + 1; } int main() { cin >> n >> k; for (int i = 1; i < n; i++) { int a, b; cin >> a >> b; adj[a].push_back(b); adj[b].push_back(a); } cout << ((dp(1, 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...