本题并不难,只要按照题目要求模拟就好了。
大致思路
①用vector<People> player[2]代表2个玩家。int cur; //当前玩家 int wait; //等待玩家
②People是他们的英雄和随从,拥有health、attack、position三个属性
③Summon:将对应的People push_back到对应玩家即可
④attack:找到对应的两个People,改变health值。若死亡,则按要求改变其他随从的位置
⑤最后,所有随从按position排序,按题意输出即可
C++满分代码(无注释)
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cstring>
#define endl "\n"
using namespace std;
struct People
{
int health, attack, number;
People(int a = 0, int b = 0, int c = 0)
{
health = a;
attack = b;
number = c;
}
};
vector<People> player[2];
int n,health,attack,pos,cur,wait;
vector<People>::iterator it;
string op;
void Summon()
{
cin>>pos>>attack>>health;
for(it = player[cur].begin(); it != player[cur].end(); ++it)
{
if(it->number != 0 && it->number >= pos)
++(it->number);
}
player[cur].push_back(People(health,attack,pos));
}
void Attack()
{
int i,j,A,B;
cin>>A>>B;
for(i=0; i<player[cur].size(); ++i)
if(player[cur][i].number == A) break;
for(j=0; j<player[wait].size(); ++j)
if(player[wait][j].number == B) break;
player[cur][i].health -= player[wait][j].attack;
player[wait][j].health -= player[cur][i].attack;
if(player[cur][i].health <= 0 && A != 0)
{
for(it = player[cur].begin(); it != player[cur].end(); ++it)
{
if(it->number != 0 && it->number > A)
--(it->number);
}
player[cur].erase(player[cur].begin()+i);
}
if(player[wait][j].health <= 0 && B != 0)
{
for(it = player[wait].begin(); it != player[wait].end(); ++it)
{
if(it->number != 0 && it->number > B)
--(it->number);
}
player[wait].erase(player[wait].begin()+j);
}
}
void Check()
{
if(player[0][0].health <= 0)
cout<<-1<<endl;
else if(player[1][0].health <= 0)
cout<<1<<endl;
else cout<<0<<endl;
cout<<player[0][0].health<<endl;
cout<<player[0].size()-1;
for(int i=1; i<player[0].size(); ++i)
cout<<" "<<player[0][i].health;
cout<<endl;
cout<<player[1][0].health<<endl;
cout<<player[1].size()-1;
for(int i=1; i<player[1].size(); ++i)
cout<<" "<<player[1][i].health;
}
bool cmp(const People& a, const People& b)
{
return a.number < b.number;
}
/*
void debug()
{
for(int i=0; i<player[0].size(); ++i)
cout<<player[0][i].number<<","<<player[0][i].health<<","<<player[0][i].attack<<" ";
cout<<endl;
for(int i=0; i<player[1].size(); ++i)
cout<<player[1][i].number<<","<<player[1][i].health<<","<<player[1][i].attack<<" ";
cout<<endl;
}
*/
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
player[0].push_back(People(30,0,0));
player[1].push_back(People(30,0,0));
cin>>n;
cur = 0, wait = 1;
while(n--)
{
cin>>op;
if(op == "summon")
Summon();
else if(op == "attack")
Attack();
else if(op == "end")
swap(cur, wait);
//debug();
}
sort(player[0].begin(), player[0].end(), cmp);
sort(player[1].begin(), player[1].end(), cmp);
Check();
return 0;
}