Submission #1000637

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
using namespace std;
typedef pair<int64_t,int64_t> P;
const int64_t mod=1e9+7;


int main(){
    int N;
    P data[200010];
    cin>>N;
    for(int i=0;i<N;i++){
        int64_t a;
        cin>>a;
        data[i]=P(a,0);
    }
    for(int i=0;i<N;i++){
        int64_t b;
        cin>>b;
        data[i+N]=P(b,1);
    }
    sort(data,data+2*N);
    int64_t factorial[100010];
    factorial[0]=1;
    for(int i=1;i<100010;i++){
        factorial[i]=factorial[i-1]*i%mod;
    }
    int res=1;
    int amari0=0;
    int amari1=0;
    for(int i=0;i<2*N;i++){
        if(data[i].second==0){
            amari0++;
        }else{
            amari1++;
        }
        if(amari0!=0 && amari1!=0){
            if(amari0==1){
                res = res * factorial[amari1]%mod;
                amari1--; amari0--;
            }else{
                res = res * factorial[amari0]%mod;
                amari1--; amari0--;
            }
        }
    }
    cout<<res<<endl;
    return 0;
}

Submission Info

Judge Result