习题6-10(uva-246)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
vector<deque<int>> mheaps;

set<vector<deque<int>> > vis;

int GetCard(int index = 7,int flag = 1) {
	deque<int> &d = mheaps[index];
	if (d.empty()) return 0;
	int ret = 0;
	if (flag == 1) {
		ret = d.front();
		d.pop_front();
		return ret;
	}
	ret = d.back();
	d.pop_back();
	return ret;
	
}

int GetCardFront(int index) {
	return GetCard(index, 1);
}
int GetCardBack(int index) {
	return GetCard(index, 0);
}
void AddCard(int index,int card,int dir) {
	deque<int>& d = mheaps[index];
	if (dir == 1)
		d.push_front(card);
	else
		d.push_back(card);
}

void AddFront(int index, int card) {
	AddCard(index, card, 1);
}
void AddBack(int index, int card) {
	AddCard(index, card, 0);
}
void DealCards() {
	for (int i = 0; i < 7; i++) {
		mheaps[i].clear();
		mheaps[i].emplace_back(GetCardFront(7));
	}
}
int TakeCards(int index) {
	deque<int>& t = mheaps[index];
	if (t.size() < 3) return 0;
	
	int up1 = GetCardFront(index),up2 = GetCardFront(index),down1 = GetCardBack(index);

	if ( ( down1 + up1 + up2) % 10 == 0) {
		AddBack(7, up1);
		AddBack(7, up2);
		AddBack(7, down1);
		return 1;
	}
	else 
		AddFront(index, up2);

	int down2 = GetCardBack(index);
	if ((down1 + down2 + up1) % 10 == 0) {
		AddBack(7, up1);
		AddBack(7, down2);
		AddBack(7, down1);
		return 2;
	}else
		AddFront(index, up1);

	int down3 = GetCardBack(index);
	if ((down1 + down2 + down3) % 10 == 0) {
		AddBack(7, down3);
		AddBack(7, down2);
		AddBack(7, down1);
		return 3;
	}

	AddBack(index, down3);
	AddBack(index, down2);
	AddBack(index, down1);

	return 0;
}
int main()
{
	int t;
	mheaps.resize(8);

	while (cin >> t && t) {
		int cnt = 7, isok = 0, id = 0, flag = 0;

		vis.clear();
		for (int i = 0; i < 8; i++) {
			while (!mheaps[i].empty())mheaps[i].pop_back();
		}
		AddBack(7, t);
		for (int i = 0; i < 51; i++)
		{
			cin >> t;
			AddBack(7,t);
		}
		
		DealCards();

		while (!isok) {

			if (mheaps[7].empty()) { isok = 1; break; }
			
			if (mheaps[id].empty()) { id = (id + 1) % 7; continue;}
			
			mheaps[id].emplace_back(GetCardFront(7));

			while (TakeCards(id));
			++cnt;
			
			if (mheaps[7].empty()) { isok = 1; break; }
			else if (mheaps[7].size() == 52) { isok = 2; break; }
			else if (vis.count(mheaps)) { isok = 3; break; }

			vis.insert(mheaps);
			id = (id + 1) % 7;
		}

		if (isok == 1) cout << "Loss: " << cnt << endl;
		else if (isok == 2) cout << "Win : " << cnt << endl;
		else cout << "Draw: " << cnt << endl;
	}
	return 0;
}