NOI批量评测 - 记录详情

foo.cc: In function 'long long int IO::rd(long long int)':
foo.cc:7:77: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    7 |         #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),*p2=0),*p1++)
      |                                                                          ~~~^~
foo.cc:10:42: note: in expansion of macro 'getchar'
   10 |                 for(;!isdigit(ibuf);ibuf=getchar());
      |                                          ^~~~~~~
foo.cc:7:77: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    7 |         #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),*p2=0),*p1++)
      |                                                                          ~~~^~
foo.cc:11:41: note: in expansion of macro 'getchar'
   11 |                 for(;isdigit(ibuf);ibuf=getchar())x=x*10+(ibuf^48);
      |                                         ^~~~~~~
foo.cc: In function 'long long int IO::rds(char*, long long int)':
foo.cc:7:77: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    7 |         #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),*p2=0),*p1++)
      |                                                                          ~~~^~
foo.cc:16:42: note: in expansion of macro 'getchar'
   16 |                 for(;!isgraph(ibuf);ibuf=getchar());
      |                                          ^~~~~~~
foo.cc:7:77: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    7 |         #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),*p2=0),*p1++)
      |                                                                          ~~~^~
foo.cc:17:41: note: in expansion of macro 'getchar'
   17 |                 for(;isgraph(ibuf);ibuf=getchar())s[x++]=ibuf;
      |                                         ^~~~~~~
foo.cc: In function 'int main()':
foo.cc:83:13: warning: unused variable 'c' [-Wunused-variable]
   83 |         int c=rd(),T=rd();
      |             ^
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	5ms	4.2 MiB
#2	Accepted 4	4ms	4.1 MiB
#3	Accepted 4	5ms	4.1 MiB
#4	Accepted 4	225ms	27.3 MiB
#5	Accepted 4	227ms	27.3 MiB
#6	Accepted 4	229ms	27.4 MiB
#7	Accepted 4	215ms	27.5 MiB
#8	Accepted 4	192ms	27.3 MiB
#9	Accepted 4	221ms	27.4 MiB
#10	Accepted 4	188ms	27.5 MiB
#11	Accepted 4	5ms	4.3 MiB
#12	Accepted 4	5ms	4.3 MiB
#13	Accepted 4	4ms	4.1 MiB
#14	Accepted 4	5ms	4.3 MiB
#15	Accepted 4	5ms	4.3 MiB
#16	Accepted 4	138ms	25.4 MiB
#17	Accepted 4	150ms	25.4 MiB
#18	Accepted 4	106ms	25.3 MiB
#19	Accepted 4	62ms	18.4 MiB
#20	Accepted 4	64ms	18.4 MiB
#21	Accepted 4	68ms	18.4 MiB
#22	Accepted 4	29ms	8.9 MiB
#23	Accepted 4	28ms	8.8 MiB
#24	Accepted 4	183ms	24 MiB
#25	Accepted 4	184ms	24 MiB

#include<bits/stdc++.h>
using namespace std;
#define int long long
namespace IO
{
	char ibuf,buf[8888888],*p1=buf,*p2=buf;
	#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),*p2=0),*p1++)
	int rd(int x=0)
	{
		for(;!isdigit(ibuf);ibuf=getchar());
		for(;isdigit(ibuf);ibuf=getchar())x=x*10+(ibuf^48);
		return x;
	}
	int rds(char*s,int x=0)
	{
		for(;!isgraph(ibuf);ibuf=getchar());
		for(;isgraph(ibuf);ibuf=getchar())s[x++]=ibuf;
		s[x]=0;return x;
	}
}
using IO::rd;using IO::rds;
const int mod=1000000007;
int inv[100010];
int js[100010];
int qpow(int a,int b)
{
	int res=1;
	for(;b;b>>=1,a=a*a%mod)if(b&1)res=res*a%mod;
		return res;
}
vector<int>v[100010];
int a[100010],b[100010];
int pa[100010];
bool ok[100010];
int stdans=1,ans=0;
void dfs1(int x,int p)
{
	pa[x]=p;
	for(int y:v[x])if(y^p)dfs1(y,x);
}
int dfs(int x,int p)
{
	int sum=0;
	for(int y:v[x])if(y^p)
	{
		int q=dfs(y,x);
		ans=(ans-sum*q%mod*stdans%mod+mod)%mod;
		sum=(sum+q*inv[v[x].size()-1])%mod;
	}
	if(ok[x])ans=(ans-sum*stdans%mod+mod)%mod,sum=1;
	return sum;
}
void slv()
{
	int n=rd(),k=rd();
	for(int i=1;i<=n;i++)v[i].clear();
	for(int i=1;i<=n;i++)ok[i]=0;
	for(int i=1;i<n;i++)
	{
		a[i]=rd(),b[i]=rd();
		v[a[i]].push_back(b[i]);
		v[b[i]].push_back(a[i]);
	}
	dfs1(1,0);
	for(int i=0;i<k;i++)
	{
		int x=rd();
		if(pa[a[x]]==b[x])ok[a[x]]=1;
		else ok[b[x]]=1;
	}
	stdans=1;for(int i=1;i<=n;i++)stdans=stdans*js[v[i].size()-1]%mod;
	// cout<<stdans<<endl;
	ans=stdans*k%mod;dfs(1,0);printf("%lld\n",ans);
}
signed main()
{
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	int n=100000;
	js[0]=1;for(int i=1;i<=n;i++)js[i]=js[i-1]*i%mod;
	inv[n]=qpow(js[n],mod-2);for(int i=n;i>=1;i--)inv[i-1]=inv[i]*i%mod;
	for(int i=1;i<=n;i++)inv[i]=inv[i]*js[i-1]%mod;
	int c=rd(),T=rd();
	while(T--)slv();
	return 0;
}

递交者: SH-0348
题目: NOIP2024CGF NOIP2024CGF
比赛: 【官方数据 SH】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.8 KiB
递交时间: 2024-12-6 17:25:44
评测时间: 2024-12-6 17:33:56

分数: 100
总耗时: 2545ms
峰值时间: 229ms
峰值内存: 27.5 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录