Submission #2592030

---

Source Code Expand

#include <iostream>
using namespace std;
#include <list>
#include <stack>
#include <algorithm>
#define ll long long
//00p0d0dp0p0d

int main(){
    int n;
    cin >>n;
    int a[n];
    int b[n];
    list<int> vacant;
    int ans=0;
    ll codelen=9223372036854775807;
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    sort(a,a+n);
    for(int i=0;i<n;i++){
        cin >> b[i];
//        vacant.push_back(b[i]);
    }
    sort(b,b+n);
    int curlen=0;
    for(int i=0;i<n;i++){
        curlen+=abs(a[i]-b[i]);
    }
    ans=1;
    int another[n];
    for(int i=0;i<n-1; i++){
        int x=abs(a[i]-b[i])+abs(a[i+1]-b[i+1]);
        int y=abs(a[i]-b[i+1])+abs(a[i+1]-b[i]);
        if (x==y){
            ans*=2;
        }
    }
    cout <<ans<<endl;
//    cout <<ans<<endl;
    return 0;
}

Submission Info

Judge Result