Submission #1004425

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<cmath>
using namespace std;

#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define fi first
#define se second

#ifdef _DEBUG
ifstream ifs("input");
#define input ifs
#else
#define input cin
#endif
#define DEBUG(x) cout<<#x<<": "<<x<<endl

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;

const double PI = (1*acos(0.0)); 
const double INF = 1e9;
const double EPS = 1e-9;
const ll mod = 1e9 + 7;


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll x,n,acc=0,ans=1;
    vector<pii> AB;
    input >> n;
    rep(i, n) input >> x, AB.push_back(pii(x, 1));
    rep(i, n) input >> x, AB.push_back(pii(x, -1));
    sort(AB.begin(), AB.end());
    rep(i, AB.size()){
        if(acc > 0 && AB[i].se < 0) ans = (ans * acc) % mod;
        else if(acc < 0 && AB[i].se > 0) ans = (ans * -acc) % mod;
        acc += AB[i].se;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result