제출 #391535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391535		nohaxjustsoflo	Burza (COCI16_burza)	C++17	0 / 160	1 ms	332 KiB

burza

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

typedef long long ll;
typedef unsigned long long ull;

const int mxN = 405;
const int mxP = 7;
const int mod = 1e9+7;

bool vis[mxN];
int p[mxN];
vector<int> adj[mxN];
int down[mxN];
void dfs(int i)
{
    for(int j : adj[i])
    {
        if(j == p[i]) continue;
        p[j] = i;
        down[j] = down[i] + 1;
        dfs(j);
    }
}
///dali mogu odigrati k koraka
bool solve(int i, int k)
{
    if(k == 0) return true;
    int cnt = 0;
    for(int j : adj[i])
    {
        if(j == p[i]) continue;
        cnt += solve(j, k-1);
    }
    return cnt > 1;
}

int main()
{
    int n, k; cin >> n >> k;
    for(int i = 1; i < n; i++)
    {
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(1);
    cout << (solve(1, k)?"NE":"DA");
}

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