Pagini recente » Cod sursa (job #191496) | Cod sursa (job #1386825) | Cod sursa (job #2855594) | Cod sursa (job #1223128) | Cod sursa (job #3160655)
#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 100005
#define LOG_MAX 17
using namespace std;
ifstream in("cerere.in");
ofstream out("cerere.out");
int v[NMAX], f[NMAX][LOG_MAX + 1], k[NMAX], stramos[NMAX], pow[LOG_MAX + 5], lvl[NMAX], p[NMAX], drum[NMAX];
vector <int> adj[NMAX];
void dfs(int node)
{
for (int i = 0; i < adj[node].size(); ++i)
{
lvl[adj[node][i]] = lvl[node] + 1;
dfs(adj[node][i]);
}
}
bool cmp(int a, int b)
{
if (lvl[a] < lvl[b])
return true;
return false;
}
int main()
{
int n, i, j, a, b, l;
in >> n;
for (i = 1; i <= n; ++i)
in >> k[i];
for (i = 1; i <= n - 1; ++i)
{
in >> a >> b;
f[b][0] = a;
adj[a].push_back(b);
}
pow[0] = 1;
for (i = 1; i <= LOG_MAX; ++i)
pow[i] = pow[i - 1] * 2;
for (l = 1; l <= LOG_MAX; ++l)
{
for (i = 1; i <= n; ++i)
{
f[i][l] = f[f[i][l - 1]][l - 1];
}
}
for (i = 1; i <= n; ++i)
{
int copiek = k[i];
stramos[i] = i;
for (l = LOG_MAX; l >= 0; --l)
{
if (copiek >= pow[l])
{
//out << i << " " << l << " " << copiek << " " << stramos[i] << " " << f[stramos[i]][l] << '\n';
copiek = copiek - pow[l];
stramos[i] = f[stramos[i]][l];
}
}
}
/*for (i = 1; i <= n; ++i)
out << stramos[i] << " ";*/
int rad;
for (i = 1; i <= n; ++i)
{
if (f[i][0] == 0)
rad = i;
p[i] = i;
}
dfs(rad);
lvl[rad] = 0;
sort (p + 1, p + n + 1, cmp);
//for (i = 1; i <= n; ++i)
//out << p[i] << " " << lvl[p[i]] << '\n';
for (i = 1; i <= n; ++i)
{
if (p[i] == stramos[p[i]])
{
drum[p[i]] = 0;
//out << p[i] << " " << drum[p[i]] << '\n';
}
else
{
drum[p[i]] = drum[stramos[p[i]]] + 1;
//out << p[i] << " " << drum[p[i]] << " <- " << stramos[p[i]] << " " << drum[stramos[p[i]]] << '\n';
}
//out << drum[i] << " ";
}
for (i = 1; i <= n; ++i)
out << drum[i] << " ";
return 0;
}