Submission #3513313

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for (rint i = 1; i <= (n); i ++)
#define re0(i, n) for (rint i = 0; i < (int) n; i ++)
#define travel(i, u) for (rint i = head[u]; i; i = e[i].nxt)
#define rint register int
using namespace std;
 
template<typename tp> inline void read(tp &x) {
  x = 0; char c = getchar(); int f = 0;
  for (; c < '0' || c > '9'; f |= c == '-', c = getchar());
  for (; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar());
  if (f) x = -x;
}
#define pb push_back
#define int long long
typedef long long lo;
const int N = 3e5 + 233;
const int mo = 1e9 + 7;
int n, a[N], b[N], fac[N];


inline int sgn(int x) {
  return x > 0 ? 1 : -1;
}

signed main(void) {
  read(n);
  rep (i, n) read(a[i]);
  rep (i, n) read(b[i]);
  sort(a + 1, a + n + 1);
  sort(b + 1, b + n + 1);
  fac[0] = 1;
  rep (i, n) fac[i] = fac[i - 1] * i % mo;
  int pre = 0;
  int ans = 1;
  for (int i = 1; i <= n; i ++) {
    if (abs(a[i] - b[i]) + abs(a[i - 1] - b[i - 1])
        != abs(a[i] - b[i - 1]) + abs(a[i - 1] - b[i])) {
      ans = ans * fac[pre] % mo;
      pre = 0;
    }
    ++ pre;
  }
  ans = ans * fac[pre] % mo;
  // cout << pre << "\n";
  cout << ans << "\n";
}

Submission Info

Judge Result