Submission #2172355

---

Source Code Expand

#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
//typedef pair<int,int> P;
//typedef pair<int,P> PP;

//-----------------------------------------------------------------------------

int n;
int a[100000],b[100000];
const int MOD=1e9+7;

ll calc(int m) {
	ll res=1;
	while(m>0) (res*=m)%=MOD,m--;
	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	REP(i,n) cin>>a[i];
	REP(i,n) cin>>b[i];
	sort(a,a+n);sort(b,b+n);

	vector<int> vec;
	int dif=-1;
	REP(i,n) {
		int nowdif=b[i]-a[i];
		if(nowdif==dif) {
			vec.back()++;
		}
		else {
			dif=nowdif;
			vec.pb(1);
		}
	}
	ll ans=1;
	for(auto v:vec) (ans*=calc(v))%=MOD;
	cout<<ans<<endl;

	return 0;
}

Submission Info

Judge Result