Submission #967857

#	Time	Username	Problem	Language	Result	Execution time	Memory
967857		12345678	Burza (COCI16_burza)	C++17	0 / 160	1 ms	348 KiB

burza

#include <bits/stdc++.h>

using namespace std;

const int nx=405;

int n, k, u, v, dp[nx], s[nx];
vector<int> d[nx];

void dfs(int u, int p)
{

}

void solve(int u, int p)
{
    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});
    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);
    if (s[1]>k) cout<<"NE";
    else cout<<"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