Submission #2012417

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
 
#define MOD (long long int)(1e9+7)
#define ll long long int

ll kaijo(int n){
	if(n==1){
		return 1;
	}
	return (n*kaijo(n-1))%MOD;
}

int main(void){
	int n;
	cin>>n;
	ll a[100001];
	ll b[100001];
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	for(int i=0;i<n;i++){
		cin>>b[i];
	}

	sort(a,a+n);
	sort(b,b+n);
	a[n]=999999;
	b[n]=999999;
	ll ans=1;
	int am=0,bm=0;
	while(am<n){
		
		if(a[am]>b[bm]){
			while(a[am]>b[bm]){
				bm++;
			}
			ans*=kaijo(bm-am);
			ans%=MOD;
			am=bm;
		}else{
			while(a[am]<b[bm]){
				am++;
			}
			ans*=kaijo(am-bm);
			ans%=MOD;
			bm=am;
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result