Submission #1143115

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143115		andreifilimon	Triumphal arch (POI13_luk)	C++20	0 / 100	107 ms	1584 KiB

luk

#include <iostream>
#include <vector>

using namespace std;

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

    int maxx = adj[1];
    for(i = 2; i <= n; i++)
        maxx = max(maxx, adj[i] - 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