45 lines
714 B
C++
45 lines
714 B
C++
#include<cstdio>
|
|
#include<cstring>
|
|
#include<string>
|
|
#include<map>
|
|
using namespace std;
|
|
const int maxn=100005;
|
|
long long res;
|
|
int n,a[maxn],b[maxn];
|
|
char s[10];
|
|
map<string,int> mp;
|
|
void GB(int *a,int *b,int len)
|
|
{
|
|
if(len<=1) return;
|
|
int M=len/2,p1=0,p2=M,p=0;
|
|
GB(a,b,M); GB(a+M,b+M,len-M);
|
|
while(p1<M&&p2<len)
|
|
{
|
|
if(a[p1]<=a[p2]) b[p++]=a[p1++];
|
|
else res+=M-p1,b[p++]=a[p2++];
|
|
}
|
|
while(p1<M) b[p++]=a[p1++];
|
|
while(p2<len) b[p++]=a[p2++];
|
|
memcpy(a,b,len<<2);
|
|
}
|
|
int main()
|
|
{
|
|
#ifdef local
|
|
freopen("pro.in","r",stdin);
|
|
#endif
|
|
scanf("%d",&n);
|
|
for(int i=1;i<=n;i++)
|
|
{
|
|
scanf("%s",s);
|
|
mp[s]=i;
|
|
}
|
|
for(int i=0;i<n;i++)
|
|
{
|
|
scanf("%s",s);
|
|
a[i]=mp[s];
|
|
}
|
|
GB(a,b,n);
|
|
printf("%lld\n",res);
|
|
return 0;
|
|
}
|