📦 ved015 / Codeforces-solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    vector<int> entry(n),exit(n);
    map<int,bool> m;
    for(int i = 0; i < n; i++){
        cin >> entry[i];
        m[entry[i]] = false;
    }
    for(int i = 0; i < n; i++){
        cin >> exit[i];
    }
    int i = 0,j = 0;
    int ans = 0;
    while(i < n){
        if(m[entry[i]] == false){
            if(entry[i] == exit[j]){
                i++;
                j++;
            }
            else{
                while(j < n && entry[i] != exit[j]){
                    ans++;
                    m[exit[j]] = true;
                    j++;
                }
            }
        }
        else i++;
    }
    cout << ans << endl;
}