This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl
#define umap unordered_map
#define uset unordered_set
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const int INF = 1'000'000'007;
int n, k, p[401];
vi graph[401];
vi depth_nodes[401];
void dfs(int u, int d) {
depth_nodes[d].pb(u);
trav(v, graph[u]) if (v != p[u]) {
p[v] = u;
dfs(v, d + 1);
}
}
set<vector<int>> memo[401];
void dp(int depth, vector<int> blocked) {
bool all_blocked = 1;
trav(node, blocked) all_blocked &= node;
if (all_blocked) {
cout << "DA" << endl;
exit(0);
}
if(depth>=k)return;
if (memo[depth].count(blocked)) return;
vi next;
int pos = 0;
trav(u, depth_nodes[depth]) {
trav(v, graph[u])if(p[u]!=v) next.pb(blocked[pos]);
++pos;
}
if(next.empty()){
cout << "DA" << endl;
exit(0);
}
rep(i,0,sz(next)){
if(next[i])continue;
if(!depth&&i)continue;
next[i]=1;
dp(depth+1,next);
next[i]=0;
}
memo[depth].insert(blocked);
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
cin >> n >> k;
rep(i, 0, n - 1) {
int u, v;
cin >> u >> v;
graph[--u].pb(--v);
graph[v].pb(u);
}
dfs(0, 0);
dp(0, vi(sz(depth_nodes[0]), 0));
cout << "NE" << endl;
return 0;
}
Compilation message (stderr)
burza.cpp: In function 'void dp(int, std::vector<int>)':
burza.cpp:5:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
5 | #define rep(i, a, b) for (int i = (a); i < (b); ++i)
| ^
burza.cpp:69:5: note: in expansion of macro 'rep'
69 | rep(i,0,sz(next)){
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |