Submission #3379845

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n;cin>>n;
    int a[n],b[n];
    rep(i,n)cin>>a[i];
    rep(i,n)cin>>b[i];
    sort(a,a+n);
    sort(b,b+n);
    ll cnt=0;
    ll right=0;
    rep(i,n){
        if(a[i]<b[i]){
            while(a[right]<b[i]&&right<n)right++;
        }
        else {
            while(b[right]<a[i]&&right<n)right++;
        }
        cnt+=right-i-1;
    }
    ll ret=1;
    ll bin=2;
    while(cnt>0){
        if(cnt&1)ret=ret*bin%mod;
        bin=bin*bin%mod;
        cnt>>=1;
    }
    cout<<ret<<endl;
    return 0;
}

Submission Info

Judge Result