제출 #583005

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583005		BackNoob	Burza (COCI16_burza)	C++14	160 / 160	53 ms	3196 KiB

burza

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 427;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
int n;
int k;
int depth[mxN];
int sub[mxN];
int lef[mxN];
int rig[mxN];
bool dp[mxN][(1 << 20) + 7];
vector<int> node[mxN];
vector<int> adj[mxN];
int cnt = 0;

void dfs_pre(int u, int par)
{
	lef[u] = inf;
	rig[u] = -inf;
	if(depth[u] == k) {
		++cnt;
		lef[u] = cnt;
		rig[u] = cnt;
	}
	for(int v : adj[u]) {
		if(v == par) continue;
		depth[v] = depth[u] + 1;
		dfs_pre(v, u);
		minimize(lef[u], lef[v]);
		maximize(rig[u], rig[v]);
	}
}

void dfs(int u, int par)
{
	if(depth[u] > k) return;
	for(int v : adj[u]) {
		if(v == par) continue;
		dfs(v, u);
	}

	if(u == 1 || lef[u] == inf) return;

	int x = depth[u] - 1;
	for(int mask = 0; mask < (1 << k); mask++) {
		if(mask & (1 << x)) {
			if(dp[lef[u] - 1][mask ^ (1 << x)] == true)
				dp[rig[u]][mask] = true;
		}
	}
}

void solve()
{
	cin >> n >> k;
	for(int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	if(k >= 20) cout << "DA" << endl;
	else {
		dp[0][0] = true;
		dfs_pre(1, -1);
		dfs(1, -1);

		bool res = false;
		for(int mask = 0; mask < (1 << k); mask++)
			res |= dp[cnt][mask];

		if(res) cout << "DA";
		else cout << "NE";
	} 
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(TASK".inp" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 16 / 16
• Subtask 3: 16 / 16
• Subtask 4: 16 / 16
• Subtask 5: 16 / 16
• Subtask 6: 16 / 16
• Subtask 7: 16 / 16
• Subtask 8: 16 / 16
• Subtask 9: 16 / 16
• Subtask 10: 16 / 16