CCF 201609-3 炉石传说

CCF 201609-3 炉石传说

题目

思考和总结

没啥毛病，模拟题目，分解题干，分成召唤随从，攻击，以及游戏指令的执行几个步骤。一遍通过，来发这篇文章就是想嘚瑟一下， 因为之前看到这种模拟题目，想都不敢想。至少现在可以尝试着去分解去做，（其实自己知道，题目不难，自己还是很菜）。
最后附上CCF提交结果和代码，愿周末好运！

个人代码（c++）

#include <bits/stdc++.h>
using namespace std;

struct Defender{
	int life = 0;
	int attack = 0;
};

int flag = 1;
vector<Defender> defender[3];

void Summon(int pos,int att,int heal,int id)
{
	Defender d;
	d.attack = att;
	d.life = heal;
	if(pos > defender[id].size())
		defender[id].push_back(d);
	else
		defender[id].insert(defender[id].begin()+pos,d);
}

void Attack(int pos1,int pos2,int id1)
{
	int id2 = (id1 == 1 ? 2 : 1);
	defender[id2][pos2].life -= defender[id1][pos1].attack;
	defender[id1][pos1].life -= defender[id2][pos2].attack;
	if(pos1 != 0 && defender[id1][pos1].life <= 0)
		defender[id1].erase(defender[id1].begin()+pos1);
	if(pos2 != 0 && defender[id2][pos2].life <= 0)
		defender[id2].erase(defender[id2].begin()+pos2);
}

bool StartGame()
{
	string order;
	int pos,heal,att;
	int pos1,pos2;
	cin >> order;
	if(order == "summon")
	{
		cin >> pos >> att >> heal;
		Summon(pos,att,heal,flag);
	}
	else if(order == "attack")
	{
		cin >> pos1 >> pos2;
		Attack(pos1,pos2,flag);
		if(defender[1][0].life <= 0 || defender[2][0].life <= 0)
			return false;
	}
	else if(order == "end")
		flag = (flag == 1 ? 2 : 1);
	return true;
}

int main()
{
	int n;
	bool win = false;
	Defender temp;
	temp.attack = 0;
	temp.life = 30;
	defender[1].push_back(temp);
	defender[2].push_back(temp);

	cin >> n;
	for(int i = 0;i < n;++i)
		if(StartGame() == false)
		{
			win = true;
			break;
		}
	if(win)
		cout << (defender[1][0].life > defender[2][0].life ? 1:-1) << endl;
	else
		cout << 0 << endl;
	for(int i = 1;i <= 2;++i)
	{
		cout << defender[i][0].life << endl;
		cout << defender[i].size() - 1;
		if(defender[i].size() - 1 != 0)
			for(int j = 1;j < defender[i].size();++j)
				cout << " " << defender[i][j].life;
		cout << endl;
	}
	return 0;
} 

注：以上思路均来源于网上。文章目的只是为了自己学习总结回顾，欢迎指出错误，相互学习。如有冒犯，请联系删除，谢谢！