CodeForces 546C Soldier and Cards（数据结构模拟）

题意：两个人各有一堆牌，每次都出最上面的一张牌，记为一次操作，牌上有个权值， 权值大的获胜，先把对方刚才出的牌放在自己牌堆的最下方，再把自己刚出的牌放在最下方。什么时候一个人的牌堆没有牌了，谁就输了，即对方获胜，输出操作的总次数，和获胜的一方是谁。若始终无法有人获胜（出现无限循环了），就输出-1.

解题思路：使用队列模拟两个牌堆的操作，输入就分别压入两个队列，比较时弹出队头元素， 比较大小，获胜的一方，先把对方刚才的队头元素压入，再把自己刚才的队头元素压入。至于死循环我直接设了n的三次方作为循环上线，若超过则肯定始终无法有人获胜。

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.

Sample test(s)

input

4
2 1 3
2 4 2

output

6 2

input

3
1 2
2 1 3

output

-1

Note

First sample:

Second sample:

#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>

using namespace std;

int buf[10];
//整型变量快速输入输出函数
inline int readint()
{
    char c = getchar();
    while(!isdigit(c)) c = getchar();
    int x = 0;
    while(isdigit(c))
    {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

inline void writeint(int i)
{
    int p = 0;
    if(i == 0) p++;
    else while(i)
    {
        buf[p++] = i % 10;
        i /= 10;
    }
    for(int j = p - 1 ; j >= 0 ; --j) putchar('0' + buf[j]);
}
//
#define MAX_N 11
const int INF = 0x3f3f3f3f;
queue<int> que1;
queue<int> que2;
int main()
{
    int n = readint();
    int num1 = readint();
    for(int i = 0 ; i< num1 ; i++)
    {
        int tmp = readint();
        que1.push(tmp);
    }
    int num2 = readint();
    for(int i = 0 ; i < num2 ; i++)
    {
        int tmp = readint();
        que2.push(tmp);
    }
    int cnt = 0;
    while(!que1.empty() && !que2.empty())
    {
        if(cnt > (n * n * n))
        {
            cout<<-1<<endl;
            return 0;
        }
        int p1 = que1.front();
        int p2 = que2.front();
//        cout<<p1<<" "<<p2<<endl;
        que1.pop();
        que2.pop();

        if(p1 > p2)
        {
            cnt++;
            que1.push(p2);
            que1.push(p1);
        }
        else
        {
            cnt++;
            que2.push(p1);
            que2.push(p2);
        }
    }
    cout<<cnt<<" ";
    if(que1.empty())
    {
        cout<<2<<endl;
    }
    else if(que2.empty())
    {
        cout<<1<<endl;
    }


    return 0;
}