제출 #396641

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396641		Arinoor	Burza (COCI16_burza)	C++17	0 / 160	3 ms	2672 KiB

burza

#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstring>
#define mp              make_pair
#define ios             ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define bug(str, x)     cerr << "# " << str << " : " << x << '\n'
#define here(x)         cerr << "here " << x << '\n'

using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int inf = 1e9;
int n, k;
vector<int> G[maxn];

bool dfs(int v, int p, int h){
	if(h == k){
		return true;
	}
	int res = 0;
	for(int u : G[v]){
		if(u != p){
			res += dfs(u, v, h + 1);
		}
	}
	return res > 1;
}

int main(){
	ios;
	cin >> n >> k;
	for(int i = 0; i < n - 1; i ++){
		int u, v;
		cin >> u >> v;
		G[--u].push_back(--v);
		G[v].push_back(u);
	}
	cout << (dfs(0, -1, 0) ? "NE" : "DA");
}

• 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