# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440479 | Millad | Burza (COCI16_burza) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// In the name of god
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define debug(x) cerr << #x << " : " << x << "\n"
#define usefile freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef string str;
const ll maxn = 1e3 + 5;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const ll sq = 500;
ll n, k;
bool dp[30][maxn];
vector <ll> adj[maxn];
void dfs(ll u, ll p){
dp[0][u] = 1;
for(ll j : adj[u]){
if(j == p)continue;
dfs(j, u);
}
for(ll i = 1; i <= k; i ++){
ll cnt = 0;
for(ll j : adj[u]){
if(j == p)continue;
if(dp[i - 1][j]) cnt ++;
}
if(cnt > 1)dp[i][u] = 1;
}
}
int main(){
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> k;
return cout << "NE", 0;
for(ll i = 1; i < n; i ++){
ll u, v; cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
dfs(1, 0);
if(!dp[k][1])cout << "DA";
else cout << "NE";