3787 - 软件包管理器

2
1 2 
2 1

2

Hint

1<=N<=15000

Solution C++

#include <iostream>
#include <cstdio>
#include <algorithm>
#define rep(i,a,b) for(int i = a; i <= b; i++)
using namespace std;
const int N = 510000;
int a[N], b[N], pre[N], suc[N];
typedef long double LD;
LD ans = 1;
int main(){
	int n; scanf("%d",&n);
	rep(i,1,n) scanf("%d",&a[i]);
	rep(i,2,n) pre[a[i]] = a[i - 1];
	rep(i,1,n) scanf("%d",&b[i]);
	rep(i,1,n - 1) suc[b[i]] = b[i + 1];
	rep(i,2,n) if (pre[i] == suc[i]) ans *= 2;
	printf("%.0Lf\n",ans);
	return 0;
}