oj.uz

답안 #537409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537409 2022-03-15T05:05:03 Z mmonteiro Burza (COCI16_burza) C++17
0 / 160
 228 ms 524288 KB 
#include "bits/stdc++.h"

/*
 * Author: Matheus Monteiro
 */

using namespace std;

#define SZ(a) (int)a.size()
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const int MAX = 403;

int n, k;
vector<int> G[MAX];
int tin[MAX], tout[MAX], level[MAX], timer;
vector<int> bucket[MAX];
int dp[10 + (1 << 20)][MAX];

void dfs(int v, int p) {
	if(level[v] >= 0)
		bucket[level[v]].push_back(v);

	tin[v] = timer + 1;
	for(int u : G[v]) {
		if(u != p) {
			level[u] = level[v] + 1;
			if(level[u] < k) {
				dfs(u, v);
			}
		}
	}
	if(level[v] == k - 1)	
		timer++;

	tout[v] = timer;
}

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

	level[0] = -1;
	dfs(0, -1);

	for(int i = 0; i <= k; ++i)
		sort(bucket[i].begin(), bucket[i].end(), [&](int a, int b)
			{
				return tin[a] < tin[b];
			}
		);

	for(int i = 0; i < (1 << k); ++i)
		dp[i][0] = 1;

	for(int i = 1; i < (1 << k); ++i) 
		for(int j = 0; j < k; ++j) 
			if(i & (1 << j)) 
				for(int u : bucket[j]) 
					if(dp[i ^ (1 << j)][ tin[u] - 1])
						dp[i][ tout[u] ] = 1;		

	bool flag = false;
	for(int i = 0; i < (1 << k); ++i)
		if(dp[i][timer])
			flag = true;

	cout << (flag ? "DA\n" : "NE\n");
}

int32_t main() {

	fastio;
	solve();

	return 0;
}

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 26196 KB Output is correct
2 Correct 210 ms 206980 KB Output is correct
3 Runtime error 196 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 207056 KB Output is correct
2 Correct 203 ms 207108 KB Output is correct
3 Runtime error 186 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 213 ms 207088 KB Output is correct
2 Correct 227 ms 207092 KB Output is correct
3 Runtime error 197 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 52052 KB Output is correct
2 Correct 212 ms 207092 KB Output is correct
3 Runtime error 202 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 207084 KB Output is correct
2 Correct 210 ms 207088 KB Output is correct
3 Runtime error 197 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 206 ms 207140 KB Output is correct
2 Correct 215 ms 207088 KB Output is correct
3 Runtime error 204 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 207092 KB Output is correct
2 Correct 207 ms 207104 KB Output is correct
3 Runtime error 198 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 52056 KB Output is correct
2 Correct 213 ms 207092 KB Output is correct
3 Runtime error 205 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 26204 KB Output is correct
2 Correct 212 ms 207032 KB Output is correct
3 Runtime error 196 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 103728 KB Output is correct
2 Correct 207 ms 207096 KB Output is correct
3 Runtime error 205 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -