제출 #440470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
440470		Millad	Burza (COCI16_burza)	C++14	0 / 160	1 ms	344 KiB

burza

// In the name of god
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define debug(x) cerr << #x << " : " << x << "\n"
#define usefile freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef string str;

const ll maxn = 1e3 + 5;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const ll sq = 500;

ll n, k;
bool dp[30][maxn];
vector <ll> adj[maxn];
void dfs(ll u, ll p){
 	dp[0][u] = 1;
        for(ll j : adj[u]){
                if(j == p)continue;
                dfs(j, u);
        }
        for(ll i = 1; i <= k; i ++){
                ll cnt = 0;
                for(ll j : adj[u]){
                        if(j == p)continue;
                        if(dp[i - 1][j]) cnt ++;
                }
                if(cnt > 1)dp[i][u] = 1;
        }
}
int main(){
        ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
        cin >> n >> k;
        if(k > 19)return cout << "NE", 0;
        for(ll i = 1; i < n; i ++){
                ll u, v; cin >> u >> v;
                adj[u].pb(v);
                adj[v].pb(u);
        }
        dfs(1, 0);
        if(!dp[k][1])cout << "DA";
        else cout << "NE";
}

• 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