제출 #708255

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

burza

#include <bits/stdc++.h>

using namespace std;

int n, k;
vector <int> adj[405];
int dp[405]; /// dp[i] = nr minim de mutari daca avem coin-ul in i


void DFS(int nod, int father) {

    int maxim1 = 0, maxim2 = 0;
    for (int i : adj[nod]) {
        if (i != father)
            DFS(i, nod);
        if (dp[i] > maxim1) {
            maxim2 = maxim1;
            maxim1 = dp[i];
        }
        else if (dp[i] > maxim2) {
            maxim2 = maxim1;
            maxim1 = dp[i];
        }
    }
    if (nod != 1 && adj[nod].size() <= 2)
        dp[nod] = 0;
    else dp[nod] = maxim2 + 1;
}

int main()
{
    cin >> n >> k;
    for (int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    DFS(1, 0);
    if (dp[1] < k)
        cout << "DA\n";
    else cout << "NE\n";
    return 0;
}

• 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