Cod sursa(job #2296229)
Utilizator | Data | 4 decembrie 2018 16:15:49 | |
---|---|---|---|
Problema | Cerere | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream in("cerere.in");
ofstream out("cerere.out");
const int N=100003;
vector <int> a[N];
int n,contor,v[N],cost[N],d[N];
void dfs(int x, int niv)
{
d[niv]=x;
cost[x]=1+cost[d[niv-v[x]]];
for(auto y:a[x])
dfs(y,niv+1);
}
int main()
{
in>>n;
for(int i=1; i<=n; ++i) in>>v[i];
int x,y;
while(in>>x>>y)
{
a[x].push_back(y);
}
dfs(1,1);
for(int i=1; i<=n; ++i) out<<cost[i]-1<<" ";
return 0;
}