Submission #1143145

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143145		armin2006	Triumphal arch (POI13_luk)	C++20	0 / 100	184 ms	19680 KiB

luk

#include <iostream>
#include <vector>

using namespace std;


const int NMAX = 3e5;
vector <int> g[NMAX + 2];
int viz[NMAX + 2];
int freq[NMAX  + 2];
int max1;

void dfs(int node, int tata) {
    viz[node] = 1;
    ++freq[tata];

    for (int i = 0; i < g[node].size(); ++i) {
        if (!viz[g[node][i]])
            dfs(g[node][i], node);
    }
}

int main() {
    int n, i;
    cin >> n;

    for (i = 1; i <= n; ++i) {
        int x, y;
        cin >> x >> y;

        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(1, 0);

    for (int i = 1; i <= n; ++i)
        max1 = max(max1, freq[i]);

    cout << max1;
    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