因为操作是可逆的而且可以随意交换,那么我们把每n个数消掉其他位保留最高位即可,然后判断一下。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#define mp(a,b) make_pair(a,b)
using namespace std;
const int maxn=10005;
typedef pair<int,int>p1;
vector<p1>g,g1;
int a[maxn];
int b[maxn];
int fa[maxn];
int fb[maxn];
int main()
{
ios::sync_with_stdio(0);
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>b[i];
for(int i=1;i<=n;i++){
int k=i;
for(int j=i+1;j<=n;j++){
if(a[j]>a[k]) k=j;
}
if(k!=i){
g.push_back(mp(i,k));
g.push_back(mp(k,i));
g.push_back(mp(i,k));
swap(a[i],a[k]);
}
for(int j=30;j>=0;j--){
if((a[i]>>j)&1){
fa[i]=1<<j;
break;
}
}
for(int j=1;j<=n;j++){
if(i!=j&&(a[j]&fa[i])){
g.push_back(mp(j,i));
a[j]^=a[i];
}
}
}
for(int i=1;i<=n;i++){
int k=i;
for(int j=i+1;j<=n;j++){
if(b[j]>b[k]) k=j;
}
if(k!=i){
g1.push_back(mp(i,k));
g1.push_back(mp(k,i));
g1.push_back(mp(i,k));
swap(b[i],b[k]);
}
for(int j=30;j>=0;j--){
if((b[i]>>j)&1){
fb[i]=1<<j;
break;
}
}
for(int j=1;j<=n;j++){
if(i!=j&&(b[j]&fb[i])){
g1.push_back(mp(j,i));
b[j]^=b[i];
}
}
}
for(int i=1;i<=n;i++){
if(a[i]!=b[i]){
if(fa[i]<fb[i]){
cout<<-1<<endl;
return 0;
}
else if(fa[i]>fb[i]){
g.push_back(mp(i,i));
fa[i]=0;
a[i]=0;
for(int j=i+1;j<=n;j++){
if(a[j]==0) break;
g.push_back(mp(j-1,j));
g.push_back(mp(j,j-1));
g.push_back(mp(j-1,j));
swap(a[j],a[j-1]);
swap(fa[j],fa[j-1]);
}
i--;
}
else{
for(int j=i+1;j<=n;j++){
if(a[j]==0) break;
if(fa[j]&b[i]){
g.push_back(mp(i,j));
a[i]^=a[j];
}
}
if(a[i]!=b[i]){
cout<<-1<<endl;
return 0;
}
}
}
}
reverse(g1.begin(),g1.end());
for(p1 v:g1){
g.push_back(v);
}
cout<<g.size()<<endl;
for(p1 v:g){
cout<<v.first<<" "<<v.second<<endl;
}
}