#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using ii = pair<int, int>;
#define fastIO ios::sync_with_stdio(0); cin.tie(0);
#define fi first
#define se second
#define pb push_back
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
template<class X, class Y>
bool minimize(X &x, const Y &y) {
X eps = 1e-9;
if (x > y + eps) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
X eps = 1e-9;
if (x + eps < y) {
x = y;
return true;
} else return false;
}
const int N = 4e2 + 7, oo = 1e9 + 7;
int n, k, m, timer, ans, l[N], r[N], dp[N][1 << 20];
vector<int> adj[N];
void euler(int u, int par = -1, int depth = 0) {
if (depth == k) {
l[u] = r[u] = ++timer;
return;
}
for (int v: adj[u]) if (v != par) {
euler(v, u, depth + 1);
maximize(r[u], r[v]);
minimize(l[u], l[v]);
}
}
void dfs(int u, int par = -1, int depth = 0) {
if (depth >= k) return;
for (int v: adj[u]) if (v != par) {
dfs(v, u, depth + 1);
if (l[v] == oo) continue;
for (int i = 0; i < (1 << k); i++) if (!getBit(i, depth))
dp[r[v]][i | (1 << depth)] |= dp[l[v] - 1][i];
}
}
signed main() {
fastIO;
//#ifndef ONLINE_JUDGE
// freopen("test.inp", "r", stdin);
// freopen("test.out", "w", stdout);
//#endif
cin >> n >> k;
if (k * k >= n) { cout << "DA\n"; return 0; }
for (int i = 0; i < (1 << k); i++) dp[0][i] = 1;
for (int i = 1; i <= n; i++) l[i] = oo, r[i] = 0;
for (int i = 0, u, v; i < n - 1; i++) {
cin >> u >> v;
adj[u].pb(v); adj[v].pb(u);
} euler(1), dfs(1);
cout << (!dp[timer][(1 << k) - 1] ? "NE" : "DA");
}
/*
dp[i][mask] = can you "block out" of the first i "depth-k" nodes just blocking nodes have depth in "mask"
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
4820 KB |
Output is correct |
2 |
Correct |
124 ms |
30792 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
2132 KB |
Output is correct |
6 |
Correct |
1 ms |
596 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
116 ms |
27164 KB |
Output is correct |
2 |
Correct |
116 ms |
26684 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
118 ms |
27028 KB |
Output is correct |
6 |
Correct |
2 ms |
2388 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
117 ms |
27376 KB |
Output is correct |
2 |
Correct |
122 ms |
27004 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
1620 KB |
Output is correct |
6 |
Correct |
1 ms |
596 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
31 ms |
10700 KB |
Output is correct |
2 |
Correct |
132 ms |
31392 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
1364 KB |
Output is correct |
6 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
114 ms |
23540 KB |
Output is correct |
2 |
Correct |
116 ms |
26244 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
2 ms |
2132 KB |
Output is correct |
6 |
Correct |
2 ms |
1620 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
120 ms |
28236 KB |
Output is correct |
2 |
Correct |
121 ms |
25388 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
2260 KB |
Output is correct |
6 |
Correct |
1 ms |
1492 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
127 ms |
28160 KB |
Output is correct |
2 |
Correct |
119 ms |
26120 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
111 ms |
25348 KB |
Output is correct |
6 |
Correct |
2 ms |
1748 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
8164 KB |
Output is correct |
2 |
Correct |
123 ms |
29524 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
1364 KB |
Output is correct |
6 |
Correct |
2 ms |
2260 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
3656 KB |
Output is correct |
2 |
Correct |
129 ms |
29636 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
1492 KB |
Output is correct |
6 |
Correct |
2 ms |
2052 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
51 ms |
11380 KB |
Output is correct |
2 |
Correct |
130 ms |
29880 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
49 ms |
11972 KB |
Output is correct |
6 |
Correct |
1 ms |
1108 KB |
Output is correct |