Submission #261409

#	Time	Username	Problem	Language	Result	Execution time	Memory
261409		dolphingarlic	Burza (COCI16_burza)	C++14	160 / 160	187 ms	8312 KiB

burza

#include <bits/stdc++.h>
using namespace std;

int n, k, depth[401], l[401], r[401], cnt = 0;
vector<int> graph[401], to_check[401];
bool dp[401][1 << 20];

void dfs(int node = 1, int parent = 0) {
	if (depth[node] == k) l[node] = r[node] = ++cnt;
	else {
		for (int i : graph[node]) if (i != parent) {
			depth[i] = depth[node] + 1;
			dfs(i, node);
			l[node] = min(l[node], l[i]);
			r[node] = max(r[node], r[i]);
		}
	}
	if (node != 1) to_check[r[node]].push_back(node);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;
	if (k * k > n) return cout << "DA", 0;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		graph[u].push_back(v);
		graph[v].push_back(u);
	}
	memset(l, 0x3f, sizeof l);
	dfs();

	dp[0][0] = true;
	for (int i = 1; i <= cnt; i++) {
		for (int j = 0; j < (1 << k); j++) {
			for (int k : to_check[i]) {
				if (j & (1 << depth[k] - 1)) {
					dp[i][j] |= dp[l[k] - 1][j ^ (1 << depth[k] - 1)];
				}
			}
		}
	}
	for (int i = 0; i < (1 << k); i++) {
		if (dp[cnt][i]) return cout << "DA", 0;
	}
	cout << "NE";
	return 0;
}

Compilation message (stderr)

burza.cpp: In function 'int main()':
burza.cpp:39:28: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     if (j & (1 << depth[k] - 1)) {
                   ~~~~~~~~~^~~
burza.cpp:40:50: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
      dp[i][j] |= dp[l[k] - 1][j ^ (1 << depth[k] - 1)];
                                         ~~~~~~~~~^~~

• 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