Submission #1677446

---

Source Code Expand

#include <cstdio>
#include <algorithm>

using namespace std;
typedef long long LL;

const int N=2e5+10,Inf=1e9+10,Mod=1e9+7;

int n,X,Y,c[N],w[N],fact[N],inv[N],Mn[N],cnt[N];

void Init()
{
	scanf("%d%d%d",&n,&X,&Y);
	for (int i=1;i<=n;++i)
		scanf("%d%d",&c[i],&w[i]);
}

LL Calc(int n,int m) { return 1ll*fact[n]*inv[m]%Mod*inv[n-m]%Mod; }

void Solve()
{
	inv[0]=inv[1]=1; for (int i=2;i<=n;++i) inv[i]=1ll*(Mod-Mod/i)*inv[Mod%i]%Mod;
	fact[0]=fact[1]=1; for (int i=2;i<=n;++i) fact[i]=1ll*fact[i-1]*i%Mod,inv[i]=1ll*inv[i-1]*inv[i]%Mod;
	
	for (int i=1;i<=n;++i) Mn[i]=Inf;
	int Min=Inf,col=0,Min2=Inf,col2=0;
	for (int i=1;i<=n;++i)
		Mn[c[i]]=min(Mn[c[i]],w[i]);
	for (int i=1;i<=n;++i)
		if (Mn[i]!=Inf)
		{
			if (Mn[i]<Min)
			{
				Min2=Min; col2=col;
				Min=Mn[i]; col=i;
			}else if (Mn[i]<Min2) Min2=Mn[i],col2=i;
		}	
	for (int i=1;i<=n;++i)
	{
		if (Mn[c[i]]+w[i]<=X) cnt[c[i]]++;
		else if (c[i]!=col && w[i]+Min<=Y) cnt[c[i]]++;
		else if (c[i]!=col2 && w[i]+Min2<=Y) cnt[c[i]]++;
	}
	LL sum=0,ans=1;
	for (int i=1;i<=n;++i) if (Mn[i]!=Inf && (Mn[i]+Min<=Y || i==col)) sum+=cnt[i];
	for (int i=1;i<=n;++i)
		if (Mn[i]!=Inf && (i==col || Mn[i]+Min<=Y))
		{
			ans=ans*Calc(sum,cnt[i])%Mod;
			sum-=cnt[i];			
		}
	printf("%lld\n",ans);
}

int main()
{
	Init();
	Solve();
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void Init()’:
./Main.cpp:13: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:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&c[i],&w[i]);
                            ^

Judge Result