数据结构——队列问题——解题分析

最新推荐文章于 2024-05-21 16:00:03 发布

转载最新推荐文章于 2024-05-21 16:00:03 发布 · 179 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/www-cnxcy-com/p/4664680.html

文章标签：

#数据结构与算法

本文详细解读了两人使用不同数量的1到n张不同数值的卡片进行对战的游戏规则，包括回合制战斗机制、胜利条件及计算游戏结束所需回合数的方法。通过实例输入输出演示了解题过程。

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

Description

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 k₁ (1 ≤ k₁ ≤ n - 1), the number of the first soldier's cards. Then follow k₁ integers that are the values on the first soldier's cards, from top to bottom of his stack.

Third line contains integer k₂ (k₁ + k₂ = n), the number of the second soldier's cards. Then follow k₂ 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.

Sample Input

Input

4
2 1 3
2 4 2

Output

6 2

Input

3
1 2
2 1 3

Output

-1

Hint

First sample:

$\text{[math]}$

解题分析：此题目是一个队列问题，N用来控制可移的最多次数，t是两个人拿的牌数，n是第一个人拿的牌数，m是第二个人拿的牌数，分别用来控制输入的个数，即第一个人的牌入X队列，第二个人的牌入Y队列，判断两队列的队头（即牌数）谁大，若f比e大，则将e放到x队列中去,f仍为x队列队队头，否则就放到y中去，e仍为y中队头，直到一方队列中没有牌，则游戏结束。

程序代码：

#include<iostream>
#include<queue>
using namespace std;
const int N=1000;
queue <int>x,y;
int main()
{
    int  t,n;
    cin>>t;
    cin>>n;
    int i,a;
    for( i=0; i<n; i++)
    {
        cin>>a;
        x.push(a);
    }
    int m,b;
    cin>>m;
    for( i=0; i<m; i++)
    {
        cin>>b;
        y.push(b);
    }
    int s=0;
    while(!x.empty()&&!y.empty())
    {
        s++;
        if(s>N) break;
       int f=x.front();
       int e=y.front();
        x.pop();
        y.pop();
        if(f>e)
        {
        x.push(e);
        x.push(f);
        }
        if(e>f)
        {
        y.push(f);
        y.push(e);
        }


    }
        if(x.empty())
            cout<<s<<" "<<"2"<<endl;
        else
            if(y.empty())
                cout<<s<<" "<<"1"<<endl;
            else cout<<"-1"<<endl;

    return 0;
}