제출 #102317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102317		SirCeness	Burza (COCI16_burza)	C++14	0 / 160	3 ms	384 KiB

burza

#include <bits/stdc++.h>

#define mod 1000000007

typedef long long ll;

using namespace std;

int n, m;
list<int> adj[400];
multiset<int> sets[400];

int f(int ata, int node){
	//cout << "f(" << ata << ", " << node << ")\n";
	for (list<int>::iterator it = adj[node].begin(); it != adj[node].end(); ++it){
		if ((*it) == ata) continue;
		sets[node].insert(f(node, *it));
	}
	if (sets[node].size() < 2) return 0;
	multiset<int>::iterator it = sets[node].end();
	advance(it, -2);
	return 1+(*it);
}

int main(){
	//freopen("baskent.gir", "r", stdin);
	
	cin >> n >> m;
	for (int i = 0; i < n-1; i++){
		int a, b;
		cin >> a >> b;
		a--; b--;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	
	int ans = f(-1, 0);
	if (ans < m) cout << "DA" << endl;
	else cout << "NE" << endl;
	
}

• 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