Submission #48212117

---

Source Code Expand

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

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;

#define rep(i,l,r) for(int i(l);i<=(r);++i)
#define per(i,r,l) for(int i(r);i>=(l);--i)
#define eb emplace_back
#define File(filename) freopen(filename ".in","r",stdin),freopen(filename ".out","w",stdout)

#ifdef EXODUS
	#define Debug(...) fprintf(stderr,__VA_ARGS__)
#else
	#define Debug(...) 0
#endif

//=========================================================================================================
// Something about IO

template<typename T>
void read(T &x){
	x=0;T flg=1;
	char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')flg=-1;ch=getchar();}
	while(isdigit(ch))x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	x*=flg;
}
template<typename T,typename... Args>
void read(T &x,Args &...args){read(x),read(args...);}

//=========================================================================================================
// Define the global variables here.

bool membg=0;

constexpr int N=1e4+7,inf=1e9+7;
int n,A,B,C;
vector<int>g[N];

int f[N][N][2],siz[N],tmp[N][2];

bool memed=0;

//=========================================================================================================
// Code here.

void dfs(int u){
	if((int)g[u].size()==0){
		siz[u]=1;
		f[u][0][0]=0,f[u][1][1]=1;
		return;
	}
	for(auto v:g[u])dfs(v);
	f[u][0][0]=0;f[u][0][1]=1;siz[u]=0;
	for(auto v:g[u]){
		for(int i=0;i<=siz[u];i++)
			tmp[i][0]=f[u][i][0],tmp[i][1]=f[u][i][1];
		for(int i=siz[u]+1;i<=siz[u]+siz[v];i++)
			tmp[i][0]=tmp[i][1]=-inf;
		for(int i=0;i<=siz[u];i++)
			for(int j=0;j<=siz[v];j++)
				tmp[i+j][0]=max(tmp[i+j][0],f[u][i][0]+max(f[v][j][0],f[v][j][1])),
				tmp[i+j][1]=max(tmp[i+j][1],f[u][i][1]+f[v][j][0]);
		for(int i=0;i<=siz[u]+siz[v];i++)
			f[u][i][0]=tmp[i][0],f[u][i][1]=tmp[i][1];
		siz[u]+=siz[v];
	}
}

void solve(){
	read(n,A,B,C);
	for(int i=1;i<=n;i++)g[i].clear();
	for(int i=1;i<=n;i++)
		for(int j=0;j<=n;j++)
			f[i][j][0]=f[i][j][1]=-inf;
	for(int i=2,anc;i<=n;i++)
		read(anc),g[anc].eb(i);
	if(C&1)return printf("No\n"),void();
	dfs(1);
	if((0<=B-C/2&&B-C/2<=siz[1]&&f[1][B-C/2][0]>=B)||(0<=B-C/2+1&&B-C/2+1<=siz[1]&&f[1][B-C/2+1][1]>=B+1))
		printf("Yes\n");
	else printf("No\n");
	return;
}


//=========================================================================================================

int main(){
	Debug("%.3lfMB\n",fabs(&memed-&membg)/1024.0/1024.0);
	int timbg=clock();
	int T=1;read(T);
	while(T--)solve();
	int timed=clock();
	Debug("%.3lfs\n",1.0*(timed-timbg)/CLOCKS_PER_SEC);
	fflush(stdout);
	return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:18:28: warning: statement has no effect [-Wunused-value]
   18 |         #define Debug(...) 0
      |                            ^
Main.cpp:94:9: note: in expansion of macro ‘Debug’
   94 |         Debug("%.3lfMB\n",fabs(&memed-&membg)/1024.0/1024.0);
      |         ^~~~~
Main.cpp:18:28: warning: statement has no effect [-Wunused-value]
   18 |         #define Debug(...) 0
      |                            ^
Main.cpp:99:9: note: in expansion of macro ‘Debug’
   99 |         Debug("%.3lfs\n",1.0*(timed-timbg)/CLOCKS_PER_SEC);
      |         ^~~~~
Main.cpp:95:13: warning: unused variable ‘timbg’ [-Wunused-variable]
   95 |         int timbg=clock();
      |             ^~~~~
Main.cpp:98:13: warning: unused variable ‘timed’ [-Wunused-variable]
   98 |         int timed=clock();
      |             ^~~~~

Judge Result