Pagini recente » Cod sursa (job #645519) | Cod sursa (job #1916424) | Cod sursa (job #876716) | Cod sursa (job #618990) | Cod sursa (job #2792512)
#include<fstream>
#include<vector>
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;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
InParser cin("cerere.in");
OutParser cout("cerere.out");
int X;
vector<int>v[100000];
vector<int>dist;
vector<int>sol;
int Q[100000];
void DFS(int nod, int ind)
{
Q[ind] = nod;
sol[nod] = sol[Q[ind - dist[nod]]] + 1;
for(int i = 0; i < v[nod].size(); i++)
{
DFS(v[nod][i],ind + 1);
}
}
int main()
{
cin >> X;
dist.resize(X);
sol.resize(X);
int ind = false;
for(int i = 0; i < X; i++)
{
cin >> dist[i];
ind = (ind ^ i);
}
for(int i = 0; i < X - 1; i++)
{
int V1, V2;
cin >> V1 >> V2;
V1--, V2--;
v[V1].push_back(V2);
ind = ind ^ V2;
}
DFS(ind, false);
for(int i = 0; i < X; i++)
{
cout << sol[i] - 1 << ' ';
}
return false;
}