[noip2013]火柴排队

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<ctime>
#include<cmath>
#define LL long long
using namespace std;
#define LL long long
#define up(i,j,n) for(int i=(j);(i)<=(n);(i)++)
#define max(x,y) ((x)<(y)?(y):(x))
#define min(x,y) ((x)<(y)?(x):(y))
#define FILE "1"
const int maxn=101000,mod=99999997;
int n,c[maxn];
struct node{
int num,id;
bool operator<(const node& b)const{return num<b.num;}
}a[maxn],b[maxn];
int read(){
bool flag=0;char ch=getchar();int x=0;
while(ch>'9'||ch<'0'){if(ch=='-')flag=1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
return flag?-x:x;
}
int d[maxn];
int lowbit(int x){return x&-x;}
void add(int x){while(x<=n){d[x]+=1;x+=lowbit(x);}}
LL get(int x){LL ans=0;while(x>0)ans=(ans+d[x])%mod,x-=lowbit(x);return ans;}
void getni(){
LL ans=0;
up(i,1,n){
ans=(ans+get(n+1-c[i]))%mod;
add(n+1-c[i]);
}
printf("%I64d\n",ans);
}
void init(){
scanf("%d",&n);
up(i,1,n)a[i].num=read(),a[i].id=i;
up(i,1,n)b[i].num=read(),b[i].id=i;
sort(a+1,a+n+1);sort(b+1,b+n+1);
up(i,1,n)c[a[i].id]=b[i].id;
getni();
}
int main(){
init();
return 0;
}