cf 546C Soldier and Cards

题目链接：C. Soldier and Cards

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.

题意描述：游戏双方各有一些沓牌，牌上都有一个各不相同的值，每一轮取出最上面的牌进行比较，大的一方把对方的牌压在自己的一沓牌的下面，然后再把自己的这张牌再次压在最下面，就这样一直进行下去，直到有一方没有牌或者不会出现没有牌的情况为止。

算法分析：一看这题就知道没有什么算法，在判断游戏会一直进行下去的时候，怎么样来标记之前出现过的一沓牌的顺序，如果之后游戏双方均同时出现之前的一沓牌的顺序的状态，那么这次游戏就会一直进行下去，不会停止，此时想到一沓牌的顺序哈希成为一个值，这样就可以标记一下啦。

可惜昨晚做的时候真心日天了，哈希的方法出现很大的错误，导致电脑没电的时候也没有找到错误，难道我现在真不适合熬夜了吗？fuck,fuck,damn,damn。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#define inf 0x7fffffff
using namespace std;
const int mod=3041;

int n,k1,k2;
int an[12],bn[12],cn[24],dn[24];
int vis[3050][3050];

int main()
{
    while (scanf("%d",&n)!=EOF)
    {
        int sum=0,sum2=0;
        memset(vis,0,sizeof(vis));
        scanf("%d",&k1);
        for (int i=1 ;i<=k1 ;i++)
        {
            scanf("%d",&an[i]);
            cn[i]=an[i];
            sum += an[i]*an[i]*i;
        }
        scanf("%d",&k2);
        for (int i=1 ;i<=k2 ;i++)
        {
            scanf("%d",&bn[i]);
            dn[i]=bn[i];
            sum2 += bn[i]*bn[i]*i;
        }
        sum %= mod ;sum2 %= mod ;
        vis[sum][sum2]=1;
        sum=sum2=0;
        int flag=0,ans=0;
        int i=1,j=1,c=k1,d=k2;
        while (i<=c && j<=d)
        {
//            cout<<"debug
";
//            for (int u=i ;u<=c ;u++) cout<<cn[u]<<" ";
//            cout<<endl;
//            for (int u=j ;u<=d ;u++) cout<<dn[u]<<" ";
//            cout<<"debug end"<<endl;
            if (i!=1 && j!=1)
            {
                flag=0;
                sum=0;
                for (int u=i ;u<=c ;u++) sum += cn[u]*cn[u]*(u-i+1);
                sum2=0;
                for (int u=j ;u<=d ;u++) sum2 += dn[u]*dn[u]*(u-j+1);
                sum %= mod ;sum2 %= mod ;
                if (vis[sum][sum2])
                {
                    flag=1;
                    break;
                }
                vis[sum][sum2]=1;
            }
            if (cn[i]>dn[j])
            {
                cn[++c]=dn[j] ;cn[++c]=cn[i] ;
                i++ ;j++ ;
                ans ++ ;
            }
            else
            {
                dn[++d]=cn[i] ;dn[++d]=dn[j] ;
                i++ ;j++ ;
                ans ++ ;
            }
        }
        if (flag) printf("-1
");
        else if (i>c) printf("%d 2
",ans);
        else printf("%d 1
",ans);
    }
    return 0;
}