Submission #139115

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<string>
#include<string.h>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<complex>
#include<map>
#include<set>
#include<bitset>
#include<iostream>
#include<sstream>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; i++)
#define rrep(i,n) for(int i = 1; i <= n; i++)
#define drep(i,n) for(int i = n-1; i >= 0; i--)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y);
#define mins(x,y) x = min(x,y);
#define pb push_back
#define sz(x) (int)(x).size()
#define popcount __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;

const int MX = 100005, INF = 1000000000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int dx[] = {-1,0,1,0}, dy[] = {0,-1,0,1}; //<^>v

int n;
int a[MX];
int c[MX], mj[MX];
vi to[MX];
int ans[MX];

void cdfs(int v){
	c[v] = 1;
	rep(i,to[v].size()){
		int u = to[v][i];
		cdfs(u);
		c[v] += c[u];
	}
}
void mdfs(int v){
	mj[v] = n;
	rep(i,to[v].size()){
		int u = to[v][i];
		mdfs(u);
		if(c[mj[v]] < c[u]) mj[v] = u;
	}
}

map<int,int> t;
void adfs(int v){
	t[a[v]]++;
	rep(i,sz(to[v])){
		int u = to[v][i];
		adfs(u);
	}
}

void ddfs(int v){
	map<int,int>::iterator it = t.lower_bound(a[v]);
	if((*it).se == 1){
		t.erase(it);
	} else (*it).se--;
	rep(i,sz(to[v])){
		int u = to[v][i];
		ddfs(u);
	}
}

void dfs(int v){
	ans[v] = -1;
	map<int,int>::iterator it = t.lower_bound(a[v]);
	if(it != t.end()) ans[v] = (*it).fi;
	if(it != t.begin()){
		--it;
		if(ans[v] == -1 || (ans[v]-a[v])>=(a[v]-(*it).fi)) ans[v] = (*it).fi;
	}
	
	rep(i,sz(to[v])){
		int u = to[v][i];
		if(u == mj[v]) continue;
		adfs(u);
	}
	if(mj[v] != n){
		dfs(mj[v]);
	}
	
	rep(i,sz(to[v])){
		int u = to[v][i];
		if(u == mj[v]) continue;
		
		ddfs(u);
		dfs(u);
		adfs(u);
	}
	
	t[a[v]]++;
}


int main(){
	int aa, bb;
	scanf("%d",&n);
	rep(i,n) scanf("%d",&a[i]);
	rep(i,n-1){
		scanf("%d%d",&aa,&bb);
		to[aa].pb(bb);
		c[bb]++;
	}
	int root = 0;
	rep(i,n) if(!c[i]) root = i;
	
	cdfs(root);
	mdfs(root);
	
	dfs(root);
	
	rep(i,n) printf("%d\n",ans[i]);
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:117:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:118:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:120:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result