Submission #1025488

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

burza

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()

int N, K;
vector<int> adj[405];
int dfs(int i, int p) {
        vector<int> a;
        for (int j : adj[i]) {
                if (j == p) continue;
                a.push_back(dfs(j, i));
        }
        sort(a.begin(), a.end());
        if (a.size() <= 1) return 1;
        return a[a.size() - 2] + 1;
}

int main(int, const char **) {
        cin.tie(NULL)->sync_with_stdio(false);
        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 << (dfs(1, 0) <= K ? "DA" : "NE");
        return 0;
}

• 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