제출 #261207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261207		dolphingarlic	Burza (COCI16_burza)	C++14	0 / 160	2 ms	428 KiB

burza

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

struct Node {
    int id, par;
};

vector<int> graph[401];

bool operator<(Node A, Node B) {
    return graph[A.id].size() < graph[B.id].size();
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    priority_queue<Node> pq;
    for (int i : graph[1]) pq.push({i, 1});
    for (int i = 1; i < k && pq.size(); i++) {
        pq.pop();
        vector<Node> to_push;
        while (pq.size()) {
            Node curr = pq.top();
            pq.pop();
            for (int j : graph[curr.id]) if (j != curr.par) {
                to_push.push_back({j, curr.id});
            }
        }
        for (Node j : to_push) pq.push(j);
    }
    if (pq.size() > 1) cout << "NE";
    else cout << "DA";
    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