제출 #166643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166643		egekabas	Burza (COCI16_burza)	C++14	0 / 160	3 ms	376 KiB

burza

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll n, k;
vector<int> g[1009];
ll dfs(ll v, ll p){
    if(g[v].size() == 1)
        return 0;
    vector<int> vec;
    for(auto u : g[v]){
        if(u == p)
            continue;
        vec.pb(dfs(u, v));
    }
    if(vec.size() <= 1)
        return 0;
    sort(vec.begin(), vec.end());
    return 1+vec[vec.size()-2];
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n >> k;
    for(ll i = 0; i < n-1; ++i){
        ll t1, t2;
        cin >> t1 >> t2;
        g[t1].pb(t2);
        g[t2].pb(t1);
    }
    if(dfs(1, -1) < k){
        cout << "DA\n";
    }
    else
        cout << "NE\n";
}

• 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