oj.uz

Submission #394510

# Submission time Handle Problem Language Result Execution time Memory
394510 2021-04-26T18:11:38 Z sinamhdv Burza (COCI16_burza) C++11
160 / 160
 292 ms 105868 KB 
// COCI16_burza
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 420
#define MAXK 21

int n, k;
vector<int> adj[MAXN];
vector<bool> dp[MAXN];
vector<int> vec[MAXN];
vector<int> leaf;
int h[MAXN];
int sttime[MAXN], fntime[MAXN], timer;

void dfs(int v, int par)
{
	sttime[v] = timer;
	if (h[v] == k)
	{
		timer++;
		fntime[v] = timer;
		vec[fntime[v]].pb(v);
		return;
	}
	for (int u : adj[v])
	{
		if (u == par) continue;
		h[u] = h[v] + 1;
		dfs(u, v);
	}
	fntime[v] = timer;
	if (sttime[v] != fntime[v]) vec[fntime[v]].pb(v);
}

int32_t main(void)
{
	fast_io;
	cin >> n >> k;
	FOR(i, 0, n - 1)
	{
		int x, y;
		cin >> x >> y;
		adj[x].pb(y);
		adj[y].pb(x);
	}

	if (n <= k * k) return cout << "DA\n", 0;

	dfs(1, -1);

	FOR(i, 0, n + 5)
		dp[i].resize(1 << MAXK);
	
	dbgr(sttime + 1, sttime + n + 1);
	dbgr(fntime + 1, fntime + n + 1);

	FOR(mask, 0, 1 << k) dp[0][mask] = true;

	FOR(i, 1, fntime[1] + 1)
	{
		FOR(mask, 0, 1 << k)
		{
			for (int u : vec[i])
			{
				if (!(mask >> (h[u] - 1) & 1)) continue;
				int nmask = mask ^ (1 << (h[u] - 1));
				dp[i][mask] = (dp[i][mask] || dp[sttime[u]][nmask]);
			}
		}
	}

	if (dp[fntime[1]][(1 << k) - 1]) cout << "DA\n";
	else cout << "NE\n";

	return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 82892 KB Output is correct
2 Correct 270 ms 105764 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 47 ms 101444 KB Output is correct
6 Correct 11 ms 25376 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 100664 KB Output is correct
2 Correct 259 ms 101188 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 259 ms 102400 KB Output is correct
6 Correct 49 ms 104852 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 101960 KB Output is correct
2 Correct 264 ms 101968 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 39 ms 82332 KB Output is correct
6 Correct 12 ms 27084 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 99704 KB Output is correct
2 Correct 271 ms 105868 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 33 ms 70860 KB Output is correct
6 Correct 10 ms 22736 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 97632 KB Output is correct
2 Correct 255 ms 100548 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 47 ms 101636 KB Output is correct
6 Correct 35 ms 72216 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 101448 KB Output is correct
2 Correct 254 ms 99876 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 44 ms 94144 KB Output is correct
6 Correct 30 ms 63916 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 103264 KB Output is correct
2 Correct 280 ms 100396 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 267 ms 100668 KB Output is correct
6 Correct 38 ms 83368 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 89160 KB Output is correct
2 Correct 292 ms 103796 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 31 ms 63884 KB Output is correct
6 Correct 49 ms 103236 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 74244 KB Output is correct
2 Correct 275 ms 104836 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 35 ms 64448 KB Output is correct
6 Correct 48 ms 95192 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 88160 KB Output is correct
2 Correct 269 ms 104568 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 147 ms 89196 KB Output is correct
6 Correct 27 ms 46124 KB Output is correct