제출 #1258674

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258674		_filya_	Burza (COCI16_burza)	C++20	0 / 160	0 ms	328 KiB

burza

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;

const int N = 401;
int d[N], g[N];

vector<int> wd[N], G[N]; 

void dfs1(int s, int p) {
    d[s] = d[p] + 1;
    wd[d[s]].push_back(s);
    for (auto u : G[s]) {
        if (u == p) continue;
        dfs1(u, s);
    }
}

void dfs2(int s, int p, int k) {
    if (d[s] == k) g[s] = 1;
    else g[s] = 0;
    for (auto u : G[s]) {
        if (u == p) continue;
        dfs2(u, s, k);
        g[s] += g[u];
    }
}

int main()
{
// 	ifstream cin("input.txt");
//     ofstream cout("output.txt");
	ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
	int n, k; cin >> n >> k;
    for (int i = 0; i < n - 1; i++) {
        int u, v; cin >> u >> v;
        u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs1(0, 0);
    dfs2(0, 0, k + 1);
    vector<int> cur(1, 0);
    for (int i = 0; i < k - 1; i++) {
        if (cur.size() == 0) break;
        int best_i = cur[0], mx = g[cur[0]];
        for (auto u : cur) {
            if (g[u] > mx) {
                best_i = u;
                mx = g[u];
            }
        }
        vector<int> ncur;
        for (auto u : cur) {
            if (u != best_i) {
                for (auto v : G[u]) {
                    if (d[v] > d[u])ncur.push_back(v);
                }
            }
        }
        swap(cur, ncur);
    }
    int ans = 0;
    for (auto u : cur) ans += G[u].size() - 1;
    if (ans == 0) {
        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