显示代码纯文本
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<cstdlib>
#include<vector>
#include<queue>
using namespace std;
const int SIZEN=210;
int win[5][5]=
{
{ 0,-1, 1, 1,-1},
{ 1, 0,-1, 1,-1},
{-1, 1, 0,-1, 1},
{-1,-1, 1, 0, 1},
{ 1, 1,-1,-1, 0}
};
int N;
int na,nb;
int a[SIZEN],b[SIZEN];
void work(void){
int sa=0,sb=0;
int p=0,q=0;
for(int i=0;i<N;i++){
int ka=win[a[p]][b[q]],kb=win[b[q]][a[p]];
if(ka<0) ka=0;
if(kb<0) kb=0;
sa+=ka,sb+=kb;
p++,p%=na;
q++,q%=nb;
}
printf("%d %d\n",sa,sb);
}
void read(void){
scanf("%d%d%d",&N,&na,&nb);
for(int i=0;i<na;i++) scanf("%d",&a[i]);
for(int i=0;i<nb;i++) scanf("%d",&b[i]);
}
int main(){
freopen("rps.in","r",stdin);
freopen("rps.out","w",stdout);
read();
work();
return 0;
}