Submission

Score: 100

User: kavin8888

Problemset: เที่ยวเมืองวงกลม

Language: cpp

Time: 0.002 second

Submitted On: 2026-02-05 22:13:35

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,ans=0;
signed main(void) {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
    cin>>n;
    vector<int> a_1(n+1),a_2(n+1);
    a_1[0]=1,a_2[0]=1;
    for(int i=1;i<=n;i++){
        cin>>a_1[i];
    }
    for(int i=1;i<=n;i++) {
        cin>>a_2[i];
    }
    for (int i=1;i<=n;i++) {
        pair<int,int> path_1 = {min(a_1[i-1],a_1[i]),max(a_1[i-1],a_1[i])};
        pair<int,int> path_2 = {min(a_2[i-1],a_2[i]),max(a_2[i-1],a_2[i])};
        if (path_1==path_2){
            ans++;
            continue;
        } 
		else if(path_1>path_2) swap(path_1, path_2);
        if ((path_2.first>path_1.first && path_2.first<path_1.second) && (path_2.second<path_1.first || path_2.second>path_1.second)) ans++;
    }
    cout<<ans<<'\n';
    return 0;
}