結果

問題 No.1295 木と駒
ユーザー maroon_kurimaroon_kuri
提出日時 2020-11-20 22:53:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,017 bytes
コンパイル時間 2,537 ms
コンパイル使用メモリ 214,740 KB
実行使用メモリ 42,352 KB
最終ジャッジ日時 2024-07-23 13:34:41
合計ジャッジ時間 7,984 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 WA -
testcase_15 AC 103 ms
25,860 KB
testcase_16 AC 108 ms
25,876 KB
testcase_17 AC 101 ms
25,820 KB
testcase_18 AC 106 ms
25,844 KB
testcase_19 AC 77 ms
25,964 KB
testcase_20 AC 100 ms
42,256 KB
testcase_21 AC 82 ms
30,836 KB
testcase_22 AC 81 ms
26,276 KB
testcase_23 AC 91 ms
34,324 KB
testcase_24 AC 95 ms
34,520 KB
testcase_25 AC 72 ms
26,416 KB
testcase_26 AC 66 ms
42,236 KB
testcase_27 AC 66 ms
42,260 KB
testcase_28 AC 128 ms
40,208 KB
testcase_29 AC 66 ms
42,288 KB
testcase_30 AC 66 ms
42,352 KB
testcase_31 AC 66 ms
42,276 KB
testcase_32 AC 107 ms
36,940 KB
testcase_33 AC 98 ms
25,728 KB
testcase_34 AC 103 ms
25,712 KB
testcase_35 AC 99 ms
25,608 KB
testcase_36 AC 97 ms
25,744 KB
testcase_37 AC 99 ms
25,624 KB
testcase_38 AC 101 ms
25,556 KB
testcase_39 AC 99 ms
25,564 KB
testcase_40 AC 100 ms
25,704 KB
testcase_41 AC 73 ms
25,864 KB
testcase_42 AC 78 ms
25,852 KB
testcase_43 AC 76 ms
25,964 KB
testcase_44 AC 80 ms
25,948 KB
testcase_45 AC 79 ms
25,888 KB
testcase_46 AC 81 ms
25,920 KB
testcase_47 AC 77 ms
25,856 KB
testcase_48 AC 76 ms
25,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

//有向木じゃダメ！！
//AGC034E
//XX Opencup GP of Korea
//CF446D
//int(E)->to
template<class E,class N>
struct treedp{
	const vvc<E>& g;
	vc<N> a,b,res,sub,bus;
	vc<E> par;
	void dfs1(int v,int p){
		a[v].init(v);
		for(auto e:g[v])
			if(e!=p){
				dfs1(e,v);
				b[e]=a[v];
				a[v]=a[v]+a[e];
			}else{
				par[v]=e;
			}
		sub[v]=a[v];
		if(p!=-1)a[v]=a[v].up(par[v]);
	}
	void dfs2(int v,int p,N cur){
		per(i,g[v].size()){
			auto e=g[v][i];
			if(e==p)continue;
			bus[e]=cur+b[e];
			dfs2(e,v,bus[e].up(e));
			cur=cur+a[e];
		}
		res[v]=cur;
	}
	treedp(const vvc<E>&gg):g(gg),a(si(g)),b(si(g)),res(si(g)),sub(si(g)),bus(si(g)),par(si(g)){
		dfs1(0,-1);
		N tmp;tmp.init(0);
		dfs2(0,-1,tmp);
	}
};

struct N{
	int r;
	bool a,b,c;
	int mn,mx;
	void init(int v){
		r=v;
		a=true;
		b=true;
		c=true;
		mn=inf;
		mx=-inf;
	}
	N up(int to){
		N res;
		res.r=to;
		res.mn=r;
		res.mx=r;
		if(a){
			res.a=true;
			res.b=b&&to<mn;
		}else{
			res.a=to>mn&&c;
			res.b=false;
		}
		res.c=res.a;
		return res;
	}
	N operator+(N x)const{
		assert(r==x.r);
		N y=*this;
		if(x.mx>y.mx)swap(x,y);
		N res;
		res.r=r;
		res.mn=min(x.mn,y.mn);
		res.mx=max(x.mx,y.mx);
		if(x.b&&y.a){
			res.a=true;
			res.b=y.b;
			res.c=true;
		}else{
			res.a=false;
			res.b=false;
			if(x.mn>y.mn)swap(x,y);
			res.c=x.c&&y.b;
		}
		return res;
	}
};

void slv(){
	int n;cin>>n;
	auto t=readTree(n);
	treedp<int,N> dp(t);
	rep(i,n)if(dp.res[i].c)
		yes(0);
	else
		no(0);
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	//int t;cin>>t;rep(_,t)
	slv();
}
0