Cod sursa(job #632285)

Utilizator deneoAdrian Craciun deneo Data 10 noiembrie 2011 19:53:18
Problema Cerere Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.83 kb
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;

int v[100001], n;
int p[100001], stiva[100001], depth = 1;

vector<int> a[100001];

void bfs(int poz)
{
    int i;
    if(v[poz] == 0)
        p[poz] = 0;
    else
        p[poz] = p[stiva[depth - v[poz]]] + 1;
    stiva[depth] = poz;
    ++depth;
        for(i = 0; i < a[poz].size(); ++i)
            bfs(a[poz][i]);
    --depth;
}

int main()
{
    int i, x, y, root;
    ifstream f("cerere.in");
    ofstream g("cerere.out");
    f >> n;
    root = n * (n + 1) / 2;
    for(i = 1; i <= n; ++i)
        f >> v[i];
    for(i = 1; i < n; ++i)
    {
        f >> x >> y;
        a[x].push_back(y);
        root -= y;
    }
    bfs(root);
    for(i = 1; i <= n; ++i)
        g << p[i] << ' ';
    g.close();
    return 0;
}