Codeforces 546C Soldier and Cards【模拟】【期末考试全突击啊T T 】

最新推荐文章于 2019-03-22 12:06:00 发布

mengxiang000000

最新推荐文章于 2019-03-22 12:06:00 发布

阅读量900

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟文章标签： Codeforces 546C

本文链接：https://blog.csdn.net/mengxiang000000/article/details/53837464

模拟专栏收录该内容

75 篇文章

订阅专栏

本文介绍了一个简单的纸牌游戏，两名玩家轮流出牌比大小，胜者获得两张牌。通过模拟游戏过程，确定游戏结束所需的轮数及获胜者。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a "war"-like card game.

The rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins.

You have to calculate how many fights will happen and who will win the game, or state that game won't end.

Input

First line contains a single integer n (2 ≤ n ≤ 10), the number of cards.

Second line contains integer k1 (1 ≤ k1 ≤ n - 1), the number of the first soldier's cards. Then follow k1 integers that are the values on the first soldier's cards, from top to bottom of his stack.

Third line contains integer k2 (k1 + k2 = n), the number of the second soldier's cards. Then follow k2 integers that are the values on the second soldier's cards, from top to bottom of his stack.

All card values are different.

Output

If somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.

If the game won't end and will continue forever output - 1.

Examples

input
4
2 1 3
2 4 2

output
6 2

input
3
1 2
2 1 3

output
-1

Note

First sample:

$\text{[math]}$

Second sample:

$\text{[math]}$

题目大意：

两个人玩纸牌游戏，每一轮游戏每个人都把自己的第一个牌拿出来比较大小，大的一方先将对面的这个牌放在自己牌的最后，再把自己的牌放在最后，直到一个人没有了纸牌就算那个人输，问一共会进行多少次游戏，以及赢的人的编号。

思路（明天考Java敲完这题就要滚去预习啦好不开心）：

观察到N最大也就是10，那么我们用两个队列来模拟这个游戏过程即可。

处理细节注意不要拿空队列中的元素。

T T期末考试突击鸭梨大啊，我空寂不住我积极啊...........我想敲题啊.............T T

Ac代码：

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        queue<int >a;
        queue<int >b;
        int tmp;
        scanf("%d",&tmp);
        for(int i=0;i<tmp;i++)
        {
            int x;
            scanf("%d",&x);
            a.push(x);
        }
        scanf("%d",&tmp);
        for(int i=0;i<tmp;i++)
        {
            int x;
            scanf("%d",&x);
            b.push(x);
        }
        int cnt=0;
        int flag=0;
        while(cnt<=1400000)
        {
            int u=a.front();a.pop();
            int v=b.front();b.pop();
            cnt++;
            if(u>v)
            {
                a.push(v);
                a.push(u);
            }
            else
            {
                b.push(u);
                b.push(v);
            }
            if(a.size()==0&&b.size()==0)
            {
                break;
            }
            if(a.size()==0)
            {
                printf("%d %d\n",cnt,2);
                flag=1;
            }
            if(b.size()==0)
            {
                printf("%d %d\n",cnt,1);
                flag=1;
            }
            if(flag==1)break;
        }
        if(flag==0)printf("-1\n");
    }
}