Nu aveti permisiuni pentru a descarca fisierul grader_test13.ok
Cod sursa(job #3139056)
Utilizator | Data | 24 iunie 2023 17:01:32 | |
---|---|---|---|
Problema | Cerere | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.95 kb |
#include <fstream>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
#define NMAX 100005
int v[NMAX], G[NMAX];
int dp[17][NMAX];
int str(int nod, int ordin, int &nr)
{
int i = 0;
while (ordin)
{
if (ordin % 2)
nod = dp[i][nod];
ordin /= 2;
i++;
}
nr++;
if (v[nod] != 0)
str(nod, v[nod], nr);
}
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
for (int i = 1; i < n; ++i)
{
int a, b;
fin >> a >> b;
dp[0][b] = a;
}
for (int i = 1; (1 << i) <= n; ++i)
for (int j = 1; j <= n; ++j)
if (dp[i - 1][j])
dp[i][j] = dp[i - 1][dp[i - 1][j]];
for (int i = 1; i <= n; ++i)
{
int nr = 0;
if (v[i])
str(i, v[i], nr);
fout << nr << ' ';
}
return 0;
}