Submission #879016

#	Time	Username	Problem	Language	Result	Execution time	Memory
879016		serifefedartar	Burza (COCI16_burza)	C++17	0 / 160	1 ms	600 KiB

burza

#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9 + 9;
const ll LOGN = 21;
const ll MAXN = 1e6 + 100;

vector<vector<int>> graph;
int dfs(int node, int parent) {
	vector<int> all;
	for (auto u : graph[node]) {
		if (u == parent)
			continue;
		all.push_back(dfs(u, node) + 1);
	}

	if (all.size() <= 1)
		return 0;
	sort(all.begin(), all.end());
	all.pop_back();
	return all.back();
}

int main() {
	fast
	int N, K, A, B;
	cin >> N >> K;

	graph = vector<vector<int>>(N+1, vector<int>());
	for (int i = 1; i < N; i++) {
		cin >> A >> B;
		graph[A].push_back(B);
		graph[B].push_back(A);
	}
	int Q = dfs(1, 1);
	cout << (Q < K ? "DA\n" : "NE\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