Submission #1232986

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232986		LaMatematica14	Star Trek (CEOI20_startrek)	C++20	0 / 100	0 ms	324 KiB

startrek

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

int main() {
    long long N, D; cin >> N >> D;
    vector<vector<int>> adj(N+1); // occhio 1-based
    for (int  i = 0; i < N-1; i++) {
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    vector<int> w(N+1, 0); // 0 for loosing
    function<void(int,int)> dfs = [&](int a, int p) {
        for (int x : adj[a]) {
            if (x == p) continue;
            dfs(x, a);
            if (w[x] == 0) w[a] = 1;
        }
    };

    dfs(1, 0);
    cout << w[1] << "\n";
}

• 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