Submission #1143129

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143129		adelina	Triumphal arch (POI13_luk)	C++20	0 / 100	198 ms	17404 KiB

luk

#include <iostream>
#include <vector>
using namespace std;

const int Nmax = 3e5 + 5;

vector<int> g[Nmax];
int cnt[Nmax];

int main()
{
    int n, a, b, i, maxx = 0;
    cin >> n;
    for(i = 1; i < n; i ++)
    {
        cin >> a >> b;
        g[a].push_back(b);

        g[b].push_back(a);
    }
    for(i = 1; i <= n; i ++)
        maxx = max(maxx, (int)g[i].size() - 1);
    cout << maxx;
    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