题解

#include<bits/stdc++.h>
using namespace std;
int a[1000], b[1000], a1[1000], b1[1000], n, l1, l2, sum1, sum2;
void f(){
	int i=1;
	for(int k=1;k<=n;k++){
		a1[k]=a[i];
		i++;
		if(i==l1+1)i=1;
	}
	i=1;
	for(int k=1;k<=n;k++){
		b1[k]=b[i];
		i++;
		if(i==l2+1)i=1;
	}
	return;
}
int main(){
	cin>>n>>l1>>l2;
	for(int i=1;i<=l1;i++)cin>>a[i];
	for(int i=1;i<=l2;i++)cin>>b[i];
	f();
	for(int i=1;i<=n;i++){
		if(a1[i]!=b1[i]){
			if(a1[i]==0){
				if(b1[i]==2||b1[i]==3)sum1++;
				else sum2++;
			}
			if(a1[i]==1){
				if(b1[i]==0||b1[i]==3)sum1++;
				else sum2++;
			}
			if(a1[i]==2){
				if(b1[i]==1||b1[i]==4)sum1++;
				else sum2++;
			}
			if(a1[i]==3){
				if(b1[i]==2||b1[i]==4)sum1++;
				else sum2++;
			}
			if(a1[i]==4){
				if(b1[i]==0||b1[i]==1)sum1++;
				else sum2++;
			}
		}
	}
	cout<<sum1<<" "<<sum2;
    return 0;
}