屯题1

#include<bits/stdc++.h>
#define N 500005
using namespace std;
int n,m,Q,xc,xs,yc,ys,a[N],b[N],sumh[N],suml[N];
int main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++) scanf("%d",&a[i]);
    for (int i=1;i<=m;i++) scanf("%d",&b[i]);
    for (int i=2;i<=n;i++) sumh[i]=sumh[i-1]+(a[i]!=a[i-1]);
    for (int i=2;i<=m;i++) suml[i]=suml[i-1]+(b[i]!=b[i-1]);
    scanf("%d",&Q);
    while (Q--){
        scanf("%d%d%d%d",&xs,&ys,&xc,&yc);
        if (xs>xc) swap(xs,xc);
        if (ys>yc) swap(ys,yc);
        int tmp=sumh[xc]-sumh[xs];
        tmp=min(tmp,sumh[n]-sumh[xc]+(a[1]!=a[n])+sumh[xs]);
        int ans=tmp;
        tmp=suml[yc]-suml[ys];
        tmp=min(tmp,suml[m]-suml[yc]+(b[1]!=b[m])+suml[ys]);
        printf("%d\n",tmp+ans);
    }
    return 0;
}