제출 #1043348

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

burza

#include <bits/stdc++.h>

using namespace std;

const int nx=405;

int n, k, u, v, s[nx], cnt, vs[nx], idx[nx], lvl[nx];
vector<int> d[nx];

void solve(int u, int p)
{
    lvl[u]=lvl[p]+1;
    if (d[u].size()==1) return s[u]=1, void();
    pair<int, int> mx;
    for (auto v:d[u]) if (v!=p) solve(v, u), mx=max(mx, {s[v], v});
    idx[u]=mx.second;
    pair<int, int> mx2;
    for (auto v:d[u]) if (v!=p&&v!=mx.second) mx2=max(mx2, {s[v], v});
    if (mx2.first!=0) s[u]=mx2.first+1;
    else s[u]=1;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<n; i++) cin>>u>>v, d[u].push_back(v), d[v].push_back(u);
    solve(1, 1);
    //for (int i=1; i<=n; i++) cout<<"debug "<<i<<' '<<idx[i]<<' '<<s[i]<<'\n';
    vector<int> t;
    t.push_back(1);
    while (1)
    {
        pair<int, int> mx;
        for (auto x:t) mx=max(mx, {s[x], x});
        vs[idx[mx.second]]=1;
        vector<int> tmp;
        for (auto x:t) if (!vs[x]) for (auto v:d[x]) if (lvl[v]>lvl[u]) tmp.push_back(v);
        if (tmp.empty()) break;
        t=tmp;
        cnt++;
    }
    if (cnt<k) 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