Pagini recente » Cod sursa (job #2624862) | Cod sursa (job #786581) | Cod sursa (job #146217) | Cod sursa (job #3287849) | Cod sursa (job #2134219)
#include<fstream>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
} in( "cerere.in" );
ofstream out ("cerere.out");
int n,a,b,x,y,sol,normalizare[1000001],aux[30],stramos[100001],k[100001],stramosi[20][100001];
void afla (int nod) {
if (normalizare[nod] != -1) {
return;
}
if (stramos[nod] == nod) {
normalizare[nod] = 0;
return;
}
if (normalizare[stramos[nod]] == -1) {
afla (stramos[nod]);
}
normalizare[nod] = normalizare[stramos[nod]] + 1;
return;
}
int main (void) {
in >> n;
for (int i = 1; i <= n; i ++) {
in >> k[i];
}
for (int i = 1; i < n; i ++) {
in >> a >> b;
stramosi[0][b] = a;
}
for (int i = 1; i < 20; i ++) {
for (int j = 1; j <= n; j ++) {
stramosi[i][j] = stramosi[i-1][stramosi[i-1][j]];
}
}
for (int i = 1; i <= n; i ++) {
x = k[i];
y = 0;
while (x > 0) {
aux[++y] = x % 2;
x /= 2;
}
stramos[i] = i;
for (int j = y; j >= 1; j --) {
if (aux[j] == 1) {
stramos[i] = stramosi[j-1][stramos[i]];
}
}
}
for (int i = 1; i <= n; i ++) {
normalizare[i] = -1;
}
for (int i = 1; i <= n; i ++) {
afla (i);
out << normalizare[i] <<" ";
}
return 0;
}