Submission #1143291

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143291		db_123	Triumphal arch (POI13_luk)	C++20	0 / 100	183 ms	18472 KiB

luk

#include <iostream>
#include <vector>

using namespace std;

int n, rs = -1e9;
vector<vector<int>> graph;
vector<int> dp;

void read() {
    cin >> n;
    graph.resize(n + 1);
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].emplace_back(b);
        graph[b].emplace_back(a);
    }
}

void dfs(int node, int par) {
    int cnt = 0;
    for (auto it : graph[node]) {
        if (it == par) {
            continue;
        }
        cnt ++;
    }
    dp[node] = cnt;
    for (auto it : graph[node]) {
        if (it == par) {
            continue;
        }
        dfs(it, node);
        dp[node] = max(dp[node], dp[it]);
    }
}

void solve() {
    dp.resize(n + 1);
    dfs(1, 0);
    cout << dp[1];
}

int main() {

    read();
    solve();
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10