#include #include using namespace std; using namespace atcoder; istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); } istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); } istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } typedef long long ll; typedef vector> Graph; typedef pair pii; typedef pair pll; #define FOR(i,l,r) for (int i = l;i < (int)(r); i++) #define rep(i,n) for (int i = 0;i < (int)(n); i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define my_sort(x) sort(x.begin(), x.end()) #define my_max(x) *max_element(all(x)) #define my_min(x) *min_element(all(x)) template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const int INF = (1<<30) - 1; const ll LINF = (1LL<<62) - 1; const int MOD = 998244353; const int MOD2 = 1e9+7; const double PI = acos(-1); vector di = {1,0,-1,0}; vector dj = {0,1,0,-1}; #ifdef LOCAL # include # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N, Q; cin >> N >> Q; vector A(N), B(Q); rep(i, N) cin >> A[i]; rep(i, Q) cin >> B[i]; // dist[i][j] ... 箱iにいて現在jまで撮影 vector dist(N, vector(Q + 1, INF)); dist[0][0] = 0; using P = array; // dist, i, j; priority_queue, greater

> pq; pq.push(P{0, 0, 0}); while(!pq.empty()){ auto [cost, i, j] = pq.top(); pq.pop(); if(dist[i][j] != cost) continue; if(i + 1 < N){ if(dist[i + 1][j] > cost + 1){ dist[i + 1][j] = cost + 1; pq.push(P{dist[i + 1][j], i + 1, j}); } } if(i - 1 >= 0){ if(dist[i - 1][j] > cost + 1){ dist[i - 1][j] = cost + 1; pq.push(P{dist[i - 1][j], i - 1, j}); } } if(j < Q && B[j] == A[i]){ if(dist[i][j + 1] > cost){ dist[i][j + 1] = cost; pq.push(P{dist[i][j + 1], i, j + 1}); } } } int ans = INF; rep(i, N) chmin(ans, dist[i][Q]); cout << ans << endl; }