Submission #3775654

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,m) for(int i=0; i<m; i++)
#define FOR(i,n,m) for(int i=n; i<m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 998244353
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define ll long long int
#define P pair<ll, ll>

int main(){
  ll ans = 1;
  ll fact[100010];
  fact[0] = 1;
  REP(i, 100009) fact[i+1] = (fact[i] * (i+1))%INF; 
  int n;
  cin >> n;
  P p[2*n];
  REP(i, n){
    int a;
    cin >> a;
    p[i] = {a, 0};
  }
  REP(i, n){
    int a;
    cin >> a;
    p[n+i] = {a, 1};
  }
  sort(p, p+2*n);
  int ax = 0, bx = 0;
  REP(i, 2*n){
    if(p[i].second == 0) ax++;
    else bx++;
    if(ax == bx){
      ans = (ans * fact[ax]);
      ax = 0;
      bx = 0;
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result