<JZOJ5910>duliu

愤怒

考场想到正解

然后觉得我的“正解”和正解差不多 一样的效果

被忽略的与正解的不同也想到了

然而 我懒得再写

于是快乐10分

气坏了

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#define rint register int
using std::sort;
using std::map;
//using std::cout;
//using std::endl;
template <class T>inline void read(T &X)
{
    X=;int W=;char ch=;
    while(!isdigit(ch))W|=ch=='-',ch=getchar();
    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();
    X=W?-X:X;return;
}
int n,cnt=,ans=;
long long sta[],end[],xors=,xore=,sta2[],end2[],fa[];
bool boo(true);
long long find(long long x){return fa[x]==x?x:fa[x]=find(fa[x]);}
map<int,int>num;
int main()
{
//    freopen("duliu.in","r",stdin);
//    freopen("duliu.out","w",stdout);
    read(n);
    for(rint i=;i<=n;++i)
        read(sta[i]),sta2[i]=sta[i],xors^=sta[i];
    sta[n+]=xors;sta2[n+]=xors;
    for(rint i=;i<=n;++i)
    {
        read(end[i]),end2[i]=end[i];
        xore^=end[i];
        if(xors==end[i])boo=false;
    }
    end[n+]=xore;end2[n+]=xore;
    ++n;
    sort(sta2+,sta2+n+);
    sort(end2+,end2+n+);

    for(rint i=;i<=n;++i)
    {
        if(sta2[i]!=end2[i]){printf("-1\n");return ;}
    }
    cnt=;
    for (int i=;i<=n;i++)
    {
        if (sta[i]!=end[i]||i==n)
        {
            if (i<n) ans++;
            if (!num[sta[i]]) cnt++,num[sta[i]]=cnt;
            if (!num[end[i]]) cnt++,num[end[i]]=cnt;
        }
    }
    if (ans==)
    {
        printf("0\n");
        return ;
    }
    for (int i=;i<=cnt;i++) fa[i]=i;
    for (int i=;i<=n;i++) if (sta[i]!=end[i]) fa[find(num[sta[i]])]=find(num[end[i]]);
    for (int i=;i<=cnt;i++) if (fa[i]==i) ans++;
    printf("%d\n",ans-);
return ;
}