Submission #2606635

---

Source Code Expand

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

#define MOD 1000000007

long long N;
long long A[100005];
long long B[100005];
long long memo[100005];

long long cal(long long num){
	if(memo[num] != 0)
		return memo[num];

	if(num == 1)
		return 1;
	
	memo[num] = (num * cal(num-1)) % MOD;
	return memo[num];
}

int main(){
	cin >> N;
	for(long long i = 0; i < N; i++){
		cin >> A[i];
	}
	for(long long i = 0; i < N; i++){
		cin >> B[i];
	}
	sort(A, A + N);
	sort(B, B + N);

	long long ans = 1;
	long long count = 1;

	bool abig = false;
	long long th = B[0];
	if(A[0] > B[0]) {
		abig = true;
		th = A[0];
	}

	for(long long i = 1; i < N; i++){
		if(abig){
			if(A[i] > B[i]){
				if(th < B[i]){
					ans *= cal(count);
					ans %= MOD;
					count = 1;
					th = A[i];
				}else {
					count++;
				}
			}else{
				//A[i] < B[i]
				abig = false;
				ans *= cal(count);
				ans %= MOD;
				count = 1;
				th = B[i];
			}
		}else{
			if(A[i] > B[i]){
				abig = true;
				ans *= cal(count);
				ans %= MOD;
				count = 1;
				th = A[i];
			}else{
				//A[i] < B[i]
				if(th < A[i]){
					ans *= cal(count);
					ans %= MOD;
					count = 1;
					th = B[i];
				}else {
					count++;
				}
			}
		}
	}
	ans *= cal(count);
	ans %= MOD;
	cout << ans << endl;
}

Submission Info

Judge Result