제출 #576735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
576735		timreizin	Star Trek (CEOI20_startrek)	C++17	0 / 100	1 ms	316 KiB

startrek

#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <stack>
#include <numeric>

using namespace std;

using ll = long long;

const ll MOD = 1e9 + 7;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, d;
    cin >> n >> d;
    vector<vector<int>> adj(n + 1);
    for (int i = 0; i + 1 < n; ++i)
    {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    auto dfs = [&adj](auto self, int v, int p) -> bool
    {
        bool res = 0;
        for (int u : adj[v]) if (u != p) res = res || !self(self, u, v);
        return res;
    };
    if (dfs(dfs, 1, 0)) cout << 1;
    else cout << 0;
    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 7
• Subtask 3: 0 / 8
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 15