Submission #1143154

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143154		andreifilimon	Triumphal arch (POI13_luk)	C++20	0 / 100	31 ms	1604 KiB

luk

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, a, b;
    cin >> n;
    if(n == 1) {
        cout << 0 << "\n";
        return 0;
    }

    vector<int> adj(n + 1, 0);
    for(int i = 0; i < n - 1; i++) {
        cin >> a >> b;
        adj[a]++;
        adj[b]++;
    }

    int maxx = adj[1];
    for(int u = 2; u <= n; u++) 
        maxx = max(maxx, adj[u] - 1);
    cout << maxx;
}

• 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