Submission #1000590

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N; cin >> N;
	vector<int> a(N), b(N);
	rep(i, N) cin >> a[i];
	rep(i, N) cin >> b[i];
	vector<i_i> p;
	rep(i, N) p.pb(i_i(a[i], -1));
	rep(i, N) p.pb(i_i(b[i], 1));
	sort(p.begin(), p.end());
	vector<int> sum(N * 2 + 1);
	rep(i, N * 2) {
		int z = p[i].second;
		sum[i + 1] = sum[i] + z;
	}
	vector<int> v;
	rep(i, N * 2 + 1) if (!sum[i]) v.pb(i);
	ll ans = 1;
	for (int k = 0; k + 1 < v.size(); k++) {
		int d = v[k + 1] - v[k];
		d /= 2;
		rep(x, d) ans = ans * (x + 1) % MOD;
	}
	cout << ans << endl;
}

Submission Info

Judge Result