Submission #2203921

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#define Mod 1000000007
struct node{
	int c,w;
}a[100001];
int n,X,Y,mini[100001],min1,min2=Mod,inv[100001],cnt[10001],sum;long long ans=1;
bool in1[100001],in2[100001];
bool cmp(node x,node y){return x.w<y.w;}
int main()
{
	scanf("%d%d%d",&n,&X,&Y);
	inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*(Mod-Mod/i)*inv[Mod%i]%Mod;
	for(int i=2;i<=n;++i)inv[i]=1ll*inv[i-1]*inv[i]%Mod;
	for(int i=1;i<=n;++i)scanf("%d%d",&a[i].c,&a[i].w);
	std::sort(a+1,a+n+1,cmp);
	min1=a[1].w;for(int i=2;i<=n;++i)if(a[i].c!=a[1].c){min2=a[i].w;break;}
	for(int i=1;i<=n;++i){
		if(!mini[a[i].c])mini[a[i].c]=a[i].w,cnt[a[i].c]++,in1[i]=1;
		else if(a[i].w+mini[a[i].c]<=X&&!in1[i])cnt[a[i].c]++,in1[i]=1;
		if(a[i].c==a[1].c)if(min2+a[i].w<=Y){
			if(!in1[i])cnt[a[i].c]++;
			in2[a[i].c]=in1[i]=1;
		}
			
		if(a[i].c!=a[1].c)if(min1+a[i].w<=Y){
			if(!in1[i])cnt[a[i].c]++;
			in2[a[i].c]=in1[i]=1;
		}
	}
	for(int i=1;i<=n;++i)if(in2[i])
		sum+=cnt[i],ans=1ll*ans*inv[cnt[i]]%Mod;
	for(int i=2;i<=sum;++i)ans=1ll*ans*i%Mod;
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&X,&Y);
                          ^
./Main.cpp:15:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;++i)scanf("%d%d",&a[i].c,&a[i].w);
                                                    ^

Judge Result