QAQ求大佬拯救

#include <iostream>
#include <cmath>
using namespace std;
int t[5][5]={
    {0,2,1,1,2},
    {1,0,2,1,2},
    {2,1,0,2,1},
    {2,2,1,0,1},
    {1,1,2,2,0}
};
int an[2001],bn[2001];
int main(){
    
    int n,a,b;
    cin>>n>>a>>b;
    for(int i=1;i<=a;i++){
        cin>>an[i];
    }
    for(int i=1;i<=b;i++){
        cin>>bn[i];
    }
    int ap=0,bp=0,ansa=1,ansb=1;
    for(int i=0;i<n;i++){
        if(ap>a) ap=1;
        if(bp>b) bp=1;
        if(t[an[ap]][bn[bp]]==1) ansa++;
        else if(t[an[ap]][bn[bp]]==2) ansb++;
        ap++;
        bp++;
    }
    cout<<ansa-1<<' '<<ansb-1<<endl;
    
    return 0;
}