Cod sursa(job #1759754)

Utilizator mariakKapros Maria mariak Data 19 septembrie 2016 19:23:21
Problema Zvon Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.83 kb
#include <bits/stdc++.h>
#define Nmax 100002
#define pb(x) push_back(x)

FILE *fout = freopen("zvon.out", "w", stdout);

using namespace std;
int T, n, k;
bool ok;
vector <int> G[Nmax];
class InputReader
{
public:
    InputReader() {}
    InputReader(const char *file_name)
    {
        input_file = fopen(file_name, "r");
        cursor = 0;
        fread(buffer, SIZE, 1, input_file);
    }
    inline InputReader &operator >>(int &n)
    {
        while(buffer[cursor] < '0' || buffer[cursor] > '9')
        {
            advance();
        }
        n = 0;
        while('0' <= buffer[cursor] && buffer[cursor] <= '9')
        {
            n = n * 10 + buffer[cursor] - '0';
            advance();
        }
        return *this;
    }
private:
    FILE *input_file;
    static const int SIZE = 1 << 17;
    int cursor;
    char buffer[SIZE];
    inline void advance()
    {
        ++ cursor;
        if(cursor == SIZE)
        {
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
    }
};
int DFS(int x)
{
    int maxx = 0;
    for(int i = 0; i < G[x].size(); ++ i)
    {
        int y = G[x][i];
        int val = DFS(y);
        if(x == 1)
        {
            if(maxx == val) ++ k;
            if(maxx < val)
                maxx = val, k = 1;
        }
        else if(maxx < val) maxx = val;
    }
    if(!G[x].size()) return 0;
    return maxx + 1;
}
int main()
{
    int x, y;
    InputReader cin("zvon.in");
    cin >> T;
    while(T --)
    {
        ok = k = 0;
        cin >> n;
        if(n == 1)
            ok = 1;

        for(int i = 1; i < n; ++ i)
        {
            cin >> x >> y;
            G[x].pb(y);
        }
        if(!ok)
            printf("%d\n", DFS(1) + k - 1);
        else printf("0\n");
    }
    return 0;
}