codeforces-546c

最新推荐文章于 2020-05-30 15:58:31 发布

mengyinhu123

最新推荐文章于 2020-05-30 15:58:31 发布

阅读量226

点赞数

本文链接：https://blog.csdn.net/mengyinhu123/article/details/81284014

版权

#include"iostream"
#include"algorithm"
#include"vector"
#include"stack"
#include"queue"
#include"map"
#include"cstring"
#include"cstdio"
using namespace std;
queue<int>s1,s2,s3,s4;
int main()
{
   int a,b,c,i,m,n,g=0;
   scanf("%d",&a);
   scanf("%d",&b);
   for(i=0;i<b;i++)
   {
       scanf("%d",&m);
       s1.push(m);
       s2.push(m);
   }
   scanf("%d",&c);
   for(i=0;i<c;i++)
   {
       scanf("%d",&m);
       s3.push(m);
       s4.push(m);
   }
   for(;;)
   {
       m=s1.front();n=s3.front();
       s1.pop();s3.pop();g++;
       if(m>n)
       {
           s1.push(n);
           s1.push(m);
       }
       else
       {
           s3.push(m);
           s3.push(n);
       }
       if(s1.empty())
       {
           printf("%d 2\n",g);
           break;
       }
       if(s3.empty())
       {
           printf("%d 1\n",g);
           break;
       }
       if(g>=10000)
       {
           printf("-1\n");break;
       }
   }
return 0;
}