Submission #1143112

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143112		sebi_ripa	Triumphal arch (POI13_luk)	C++20	0 / 100	169 ms	17276 KiB

luk

#include <iostream>
#include <vector>

using namespace std;

vector <int> adj[300005];
int ans = 0;

void dfs(int node, int t) {
    for(auto x : adj[node])
        if(x != t)
            dfs(x, node);
    ans = max(ans, (int)adj[node].size()-1);
}

int main() {
    int n;
    cin >> n;
    for(int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    dfs(1, 1);
    cout << ans;
}

• 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