Submission #3513392

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 1; i <= (n); i ++) 
using namespace std;

inline void fastio(void) {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
}
template <typename T>
inline void read(T &x) {
  cin >> x;
}

namespace {
  const int mo = 1e9 + 7;
  inline int add(int x, int y) {
    if((x += y) >= mo) x -= mo;
    return x;
  }
  inline int sub(int x, int y) {
    if((x -= y) < 0) x += mo;
    return x;
  }
  inline int mul(int x, int y) {
    return 1LL * x * y % mo;
  }
  inline int pw(int a, int k) {
    int ans = 1;
    for (; k; k >>= 1, a = mul(a, a))
      if (k & 1) ans = mul(ans, a);
    return ans;
  }
}
const int N = 3e5 + 233;
int n, a[N], b[N], pre = 0, ans = 1;
signed main(void) {
  fastio();
  cin >> n;
  rep (i, n) cin >> a[i];
  rep (i, n) cin >> b[i];
  sort(a + 1, a + n + 1);
  sort(b + 1, b + n + 1);
  int pre = 1;
  for (int i = 2; i <= n; i ++) {
    // cout << abs(a[i] - b[i]) + abs(a[i - 1] - b[i - 1]) << " " << abs(a[i] - b[i - 1]) + abs(a[i - 1] - b[i]) << "\n";
    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 = 1LL * ans * pre % mo;
      // cout << i << "\n";
      pre = 0;
    }
    ++ pre;
  }
  if (pre) ans = 1LL * ans * pre % mo;
  cout << ans << "\n";
}

Submission Info

Judge Result