Submission #1678171

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int N;

signed main() {
    cin >> N;
    vector<pii> vs;
    rep(i,0,N) {
        int p; cin >> p;
        vs.push_back(pii(p, 0));
    }
    rep(i,0,N) {
        int p; cin >> p;
        vs.push_back(pii(p, 1));
    }

    sort(vs.begin(), vs.end());
    int ans = 1;
    int a = 0, b = 0, diff = 0, cnt = 0;
    rep(i,0,2*N) {
        int m = vs[i].second;
        (m ? a : b)++;
        int nd = abs(a - b);
        // printf("a = %lld, b = %lld, diff = %lld, cnt = %lld\n", a, b, diff, cnt);
        if(nd < diff) {
            cnt++;
            (ans *= cnt) %= MOD;
        }
        else {
            cnt = 0;
        }
        diff = nd;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result