Codeforces Round #304 (Div. 2) C queue暴力

链接：戳这里

C. Soldier and Cards

time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard output

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:

Second sample:

题意：

两堆卡片，分别从首部各拿出一张卡片比大小，大的取走两张卡片然后放到最下面去。大的放下面。

问多少次后会有一方没有卡片

思路：

队列模拟就可以了

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define maxn 0x3f3f3f3f
#define MAX 1000100
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef unsigned long long ull;
#define INF (1ll<<60)-1
using namespace std;
queue<int> qu1;
queue<int> qu2;
int n,k1,k2,x;
int main(){
    scanf("%d",&n);
    scanf("%d",&k1);
    for(int i=1;i<=k1;i++){
        scanf("%d",&x);
        qu1.push(x);
    }
    scanf("%d",&k2);
    for(int i=1;i<=k2;i++){
        scanf("%d",&x);
        qu2.push(x);
    }
    int cnt=0;
    while(!qu1.empty() && !qu2.empty()){
        int a=qu1.front(),b=qu2.front();
        qu1.pop();
        qu2.pop();
        if(a>b){
            qu1.push(b);
            qu1.push(a);
        } else {
            qu2.push(a);
            qu2.push(b);
        }
        cnt++;
        if(cnt>1e7) {
            cout<<-1<<endl;
            return 0;
        }
    }
    cout<<cnt<<" ";
    if(qu1.size()) cout<<1<<endl;
    else cout<<2<<endl;
    return 0;
}