Submission #1196474

---

Source Code Expand

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

#define rep(i, a, b) for(int i = (a); i < int(b); ++i)
#define rrep(i, a, b) for(int i = (a) - 1; i >= int(b); --i)
#define trav(it, v) for(typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define all(v) (v).begin(), (v).end()
#define what_is(x) cerr << #x << " is " << x << endl;

typedef double fl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;

ll c[200005], w[200005];
ll colorWeight[200005];
ll colorWeight2[200005];
ll colorCount[200005];
ll minWeight;

ll powerMod(ll a, ll x){
	if(x == 0)
		return 1;
	if(x%2)
		return (a*powerMod((a*a)%MOD, x/2))%MOD;
	return (powerMod((a*a)%MOD, x/2));
}

ll inv(ll a){
	return powerMod(a, MOD-2);
}

ll invfac[200005];
ll fac[200005];

int main(){
	invfac[0]=1;
	fac[0]=1;
	rep(i,1,200003){
		fac[i]=(fac[i-1]*i)%MOD;
		invfac[i]=(invfac[i-1]*inv(i))%MOD;
		assert((fac[i]*invfac[i])%MOD == 1);
	}
	ll N, X, Y;
	scanf("%lld%lld%lld", &N, &X, &Y);
	assert(N <= 200000);
	assert(X <= 1000000000);
	assert(Y <= 1000000000);
	rep(i,0,N+1){
		colorWeight[i]=1050000000;
		minWeight = 1050000000;
		assert(colorWeight[i] > X && colorWeight[i] > Y);
	}
	assert(minWeight > X && minWeight > Y);
	int minColor=-1;
	rep(i,0,N){
		scanf("%lld%lld", c+i, w+i);
		assert(c[i] <= N);
		assert(c[i] >= 1);
		assert(w[i] <= 1000000000);
		assert(w[i] >= 1);
		colorWeight[c[i]] = min(colorWeight[c[i]], w[i]);
		if(w[i] < minWeight){
			minWeight = min(minWeight, w[i]);
			minColor = c[i];
		}
	}
	rep(i,0,N+1){
		colorWeight2[i]=colorWeight[i];
	}
	sort(colorWeight2, colorWeight2+(N+1));
	int minWeight2 = colorWeight2[1];
	int movable=0;
	rep(i,0,N){
		int tw = minWeight;
		if(c[i] == minColor)
			tw = minWeight2;
		if(w[i]+colorWeight[c[i]] <= X || w[i]+tw <= Y){
			if(colorWeight[c[i]]+minWeight <= Y){
				++colorCount[c[i]];
				++movable;
			}
		}
	}
	ll ans=fac[movable];
	rep(i,0,N+1){
		if(!colorCount[i])
			continue;
		ans = (ans*invfac[colorCount[i]])%MOD;
	}
	assert(ans >= 0 && ans < MOD);
	sort(colorWeight, colorWeight+(N+1));
	if(colorWeight[0]+colorWeight[1] > Y)
		cout << "1" << endl;
	else
		cout << ans << endl;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld", &N, &X, &Y);
                                   ^
./Main.cpp:59:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", c+i, w+i);
                              ^

Judge Result