제출 #1175239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1175239		nuutsnoynton	Burza (COCI16_burza)	C++20	0 / 160	1 ms	332 KiB

burza

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

ll D[402] = {0}, m;
ll S[402] = {0};

vector < ll > adj[402];

void Go(ll node, ll par) {
	for ( ll chi : adj[node]) {
		if ( chi == par) continue;
		D[chi] = D[node] + 1;
		if ( D[chi] == m) S[chi] = 1;
		Go(chi, node);
		S[node] += S[chi];
	}
}
ll mx_node, mx_sz;
bool DFS(ll node, ll par) {
	if (D[node] > m) return true;
	if ( D[node] == m) return false;
	ll cnt = 0;
	for ( ll chi : adj[node]) {
		if ( chi == par) continue;
		if (!DFS(chi, node)) cnt ++;
	}
	if ( cnt > 1) return false;
	return true;
}
int main() {
	ll n, r, x, y, i, j, ans, t;

	cin >> n >> m;
	
	
	for (i = 1; i < n; i ++) {
		cin >> x >> y;
		adj[x].push_back(y);
		adj[y].push_back(x);
	}	
	
	Go(1, 1);
	if ( !DFS(1, 1)) cout << "NE" << endl;
	else cout << "DA" << 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