编程题#2: 魔兽世界之二:装备
来源: POJ (Coursera声明:在POJ上完成的习题将不会计入Coursera的最后成绩。)
注意: 总时间限制: 1000ms 内存限制: 65536kB
描述
魔兽世界的西面是红魔军的司令部,东面是蓝魔军的司令部。两个司令部之间是依次排列的若干城市。
红司令部,City 1,City 2,……,City n,蓝司令部
两军的司令部都会制造武士。武士一共有 dragon 、ninja、iceman、lion、wolf 五种。每种武士都有编号、生命值这两种属性。
有的武士可以拥有武器。武器有三种,sword, bomb,和arrow,编号分别为0,1,2。
双方的武士编号都是从1开始计算。红方制造出来的第 n 个武士,编号就是n。同样,蓝方制造出来的第 n 个武士,编号也是n。
不同的武士有不同的特点。
dragon 可以拥有一件武器。编号为n的dragon降生时即获得编号为 n%3 的武器。dragon还有“士气”这个属性,是个浮点数,其值为它降生后其司令部剩余生命元的数量除以造dragon所需的生命元数量。
ninjia可以拥有两件武器。编号为n的ninjia降生时即获得编号为 n%3 和 (n+1)%3的武器。
iceman有一件武器。编号为n的iceman降生时即获得编号为 n%3 的武器。
lion 有“忠诚度”这个属性,其值等于它降生后其司令部剩余生命元的数目。
wolf没特点。
请注意,在以后的题目里,武士的士气,生命值,忠诚度在其生存期间都可能发生变化,都有作用,武士手中的武器随着使用攻击力也会发生变化。
武士在刚降生的时候有一个生命值。
在每个整点,双方的司令部中各有一个武士降生。
红方司令部按照 iceman、lion、wolf、ninja、dragon 的顺序循环制造武士。
蓝方司令部按照 lion、dragon、ninja、iceman、wolf 的顺序循环制造武士。
制造武士需要生命元。
制造一个初始生命值为 m 的武士,司令部中的生命元就要减少 m 个。
如果司令部中的生命元不足以制造某个按顺序应该制造的武士,那么司令部就试图制造下一个。如果所有武士都不能制造了,则司令部停止制造武士。
给定一个时间,和双方司令部的初始生命元数目,要求你将从0点0分开始到双方司令部停止制造武士为止的所有事件按顺序输出。
一共有两种事件,其对应的输出样例如下:
1) 武士降生
输出样例: 004 blue lion 5 born with strength 5,2 lion in red headquarter
表示在 4点整,编号为5的蓝魔lion武士降生,它降生时生命值为5,降生后蓝魔司令部里共有2个lion武士。(为简单起见,不考虑单词的复数形式)注意,每制造出一个新的武士,都要输出此时司令部里共有多少个该种武士。
如果造出的是dragon,那么还要输出一行,例:
It has a arrow,and it's morale is 23.34
表示该dragon降生时得到了arrow,其士气是23.34(为简单起见,本题中arrow前面的冠词用a,不用an,士气精确到小数点后面2位,四舍五入)
如果造出的是ninjia,那么还要输出一行,例:
It has a bomb and a arrow
表示该ninjia降生时得到了bomb和arrow。
如果造出的是iceman,那么还要输出一行,例:
It has a sword
表示该iceman降生时得到了sword。
如果造出的是lion,那么还要输出一行,例:
It's loyalty is 24
表示该lion降生时的忠诚度是24。
2) 司令部停止制造武士
输出样例: 010 red headquarter stops making warriors
表示在 10点整,红方司令部停止制造武士
输出事件时:
首先按时间顺序输出;
同一时间发生的事件,先输出红司令部的,再输出蓝司令部的。
输入
第一行是一个整数,代表测试数据组数。
每组测试数据共两行。
第一行,一个整数M。其含义为: 每个司令部一开始都有M个生命元( 1 <= M <= 10000)
第二行:五个整数,依次是 dragon 、ninja、iceman、lion、wolf 的初始生命值。它们都大于0小于等于10000
输出
对每组测试数据,要求输出从0时0分开始,到双方司令部都停止制造武士为止的所有事件。
对每组测试数据,首先输出“Case:n" n是测试数据的编号,从1开始
接下来按恰当的顺序和格式输出所有事件。每个事件都以事件发生的时间开头,时间以小时为单位,有三位。
样例输入
1
20
3 4 5 6 7
样例输出
Case:1
000 red iceman 1 born with strength 5,1 iceman in red headquarter
It has a bomb
000 blue lion 1 born with strength 6,1 lion in blue headquarter
It's loyalty is 14
001 red lion 2 born with strength 6,1 lion in red headquarter
It's loyalty is 9
001 blue dragon 2 born with strength 3,1 dragon in blue headquarter
It has a arrow,and it's morale is 3.67
002 red wolf 3 born with strength 7,1 wolf in red headquarter
002 blue ninja 3 born with strength 4,1 ninja in blue headquarter
It has a sword and a bomb
003 red headquarter stops making warriors
003 blue iceman 4 born with strength 5,1 iceman in blue headquarter
It has a bomb
004 blue headquarter stops making warriors
#include <iostream>
#include <iomanip>
#include <string>
using namespace std; class headquarters
{
public: headquarters(const int theLifeValue, const int theRedOrBlue, const int theWarriorValue[],
const string theWarriorNames[], const int order[], const string theHeadquarterNames[]); ~headquarters(); //获取出生数,用于战士的id计算
int getCount() { return count;} // 获取生命值,用于在main程序中与各战士的最小生命值比较,以及与战士生命值的比较
int getLifeValue() { return lifeValue; } // 获取将要出生的战士的生命值
int getWarriorValue(int position) { return warriorValues[position]; } // 获取将要出生的战士的名字
string getWarriorName(int position) { return warriorNames[position];} // 生产战士
void product(int time, int position); private:
int lifeValue;
int redOrBlue; // 红色总部值为0,蓝色总部值为1
int count; // 生产的战士数量
int *warriorCounts; // 记录每种战士数量的数组
string headquarterName; // 总部的名字
string *warriorNames; // 记录每种战士名字的数组
int *warriorValues; // 记录每种战士生命值的数组 }; /**
* 指定初始化
*/
headquarters::headquarters(const int theLifeValue, const int theRedOrBlue, const int theWarriorValue[],
const string theWarriorNames[], const int order[], const string theHeadquarterNames[])
{
count = ;
lifeValue = theLifeValue;
redOrBlue = theRedOrBlue;
headquarterName = theHeadquarterNames[redOrBlue]; // 从总部名字的数组取得该总部的名字
warriorCounts = new int[]{};
warriorValues = new int[];
warriorNames = new string[];
for (int i = ; i < ; ++i) {
warriorNames[i] = theWarriorNames[order[i]]; // 由给定的顺序和原始战士名字的数组,得到该总部战士名字的数组
warriorValues[i] = theWarriorValue[order[i]]; // 由给定的顺序和原始战士名字的数组,得到该总部战士生命值的数组
}
} headquarters::~headquarters() {
if (warriorCounts) delete []warriorCounts;
if (warriorValues) delete []warriorValues;
if (warriorNames) delete []warriorNames;
} /**
* 生产战士
* time参数给定战士出生的回合
* position参数给定该战士在司令部出生战士中的位置
*/
void headquarters::product(int time, int position)
{
count++;
warriorCounts[position]++; // 该种战士的总数加一
// 输出题目要求的语句
cout << setfill('')<<setw() << time << " " << headquarterName << " " << warriorNames[position]
<< " " << count << " born with strength " << warriorValues[position] << "," << warriorCounts[position]
<< " " << warriorNames[position] << " in " << headquarterName << " headquarter" << endl;
lifeValue -= warriorValues[position];
} class warrior{
private:
int id;
int lifeValue;
string *weaponNames;
public:
warrior():id(),lifeValue() {}
warrior(int theId, int theLifeValue):id(theId), lifeValue(theLifeValue) {
weaponNames = new string[] {"sword", "bomb", "arrow"};
}
~warrior() {
if (weaponNames) delete []weaponNames;
}
int getId() { return id;}
string* getWeaponNames() { return weaponNames;}
}; class dragon:public warrior {
private:
float morale; //士气属性
public:
dragon(int theId, int theLifeValue, int headquarterLifeValue):warrior(theId, theLifeValue) {
morale = (float)(headquarterLifeValue) / theLifeValue;
}
~dragon() {};
float getMorale() { return morale;}
string getWeaponName() {
int index = this->getId() % ;
return this->getWeaponNames()[index];
}
void print() {
cout<<"It has a "<<this->getWeaponName()<<",and it's morale is "<< setprecision()<<fixed<< this->getMorale()<<endl;
}
}; class ninja:public warrior {
public:
ninja(int theId, int theLifeValue):warrior(theId, theLifeValue) {}
~ninja() {}
string getFirstWeaponName() {
int index = this->getId() % ;
return this->getWeaponNames()[index];
}
string getSecondWeaponName() {
int index = (this->getId() + ) % ;
return this->getWeaponNames()[index];
}
void print() {
cout<<"It has a "<<this->getFirstWeaponName()<<" and a "<<this->getSecondWeaponName()<<endl;
}
}; class iceman:public warrior {
public:
iceman(int theId, int theLifeValue):warrior(theId, theLifeValue) {}
~iceman() {};
string getWeaponName() {
int index = this->getId() % ;
return this->getWeaponNames()[index];
}
void print() {
cout<<"It has a "<<this->getWeaponName()<<endl;
}
}; class lion:public warrior {
private:
int loyalty;
public:
lion(int theId, int theLifeValue, int headquarterLifeValue):warrior(theId, theLifeValue) {
loyalty = headquarterLifeValue;}
~lion() {}
int getLoyalty() { return loyalty;}
void print() {
cout<<"It's loyalty is "<<this->getLoyalty()<<endl;
}
}; class wolf:public warrior {
public:
wolf(int theId, int theLifeValue):warrior(theId, theLifeValue) {}
~wolf() {}
}; int main()
{
const int redOrder[] = {, , , , }; // 红色总部的出兵顺序
const int blueOrder[] = {, , , , }; // 蓝色总部的出兵顺序
const string headquartersNames[] = {"red", "blue"}; // 记录总部名字的数组
const string priorNames[] = { "dragon", "ninja", "iceman", "lion", "wolf" }; // 记录战士名字的数组
int n = ; // 测试数
cin >> n;
for (int i = ; i <= n; i++)
{ int priorValue[], headquartersValue, minValue, redPosition = , bluePosition = ;
bool redHadStop = false, blueHadStop = false; cin >> headquartersValue; // 获取总部生命值
// 获取每种战士的生命值
for (int j = ; j < ; j++)
{
cin >> priorValue[j];
} cout << "Case:" << i << endl; // 计算出战士中的最小生命值
minValue = priorValue[];
for (int j = ; j < ; j++)
{
if (priorValue[j] < minValue)
{
minValue = priorValue[j];
}
} // 初始化红军总部和蓝军总部
headquarters redOne = headquarters(headquartersValue, , priorValue, priorNames, redOrder, headquartersNames);
headquarters blueOne = headquarters(headquartersValue, , priorValue, priorNames, blueOrder, headquartersNames); for (int time = ;!redHadStop || !blueHadStop; time++)
{
// 如果红军没有停止出兵,继续
if (!redHadStop)
{
// 红军的生命值小于最小战士生命值, 停止出兵,打印命令
if (redOne.getLifeValue() < minValue)
{
cout << setfill('')<<setw() << time << " red headquarter stops making warriors" << endl;
redHadStop = true;
}
else {
// 从上面的判断句筛选后,现在一定能出兵。
// 从当前position开始增加,到某个位置出兵了停止
while (true)
{
if (redOne.getLifeValue() >= redOne.getWarriorValue(redPosition))
{
redOne.product(time, redPosition); // 出兵 if (redOne.getWarriorName(redPosition) == "dragon") {
dragon theDragon(redOne.getCount(), redOne.getWarriorValue(redPosition), redOne.getLifeValue());
theDragon.print();
} else if (redOne.getWarriorName(redPosition) == "ninja") {
ninja theNinja(redOne.getCount(), redOne.getWarriorValue(redPosition));
theNinja.print();
} else if (redOne.getWarriorName(redPosition) == "iceman") {
iceman theIceman(redOne.getCount(), redOne.getWarriorValue(redPosition));
theIceman.print();
} else if (redOne.getWarriorName(redPosition) == "lion") {
lion theLion(redOne.getCount(), redOne.getWarriorValue(redPosition), redOne.getLifeValue());
theLion.print();
} else {
wolf theWolf(redOne.getCount(), redOne.getWarriorValue(redPosition));
} if (redPosition == ? redPosition = : redPosition++);
break;
}
else
{
if (redPosition == ? redPosition = : redPosition++);
}
}
}
} if (!blueHadStop)
{
if (blueOne.getLifeValue() < minValue)
{
cout << setfill('')<<setw()<< time << " blue headquarter stops making warriors" << endl;
blueHadStop = true;
}
else {
while (true)
{
if (blueOne.getLifeValue() >= blueOne.getWarriorValue(bluePosition))
{
blueOne.product(time, bluePosition); if (blueOne.getWarriorName(bluePosition) == "dragon") {
dragon theDragon(blueOne.getCount(), blueOne.getWarriorValue(bluePosition), blueOne.getLifeValue());
theDragon.print();
} else if (blueOne.getWarriorName(bluePosition) == "ninja") {
ninja theNinja(blueOne.getCount(), blueOne.getWarriorValue(bluePosition));
theNinja.print();
} else if (blueOne.getWarriorName(bluePosition) == "iceman") {
iceman theIceman(blueOne.getCount(), blueOne.getWarriorValue(bluePosition));
theIceman.print();
} else if (blueOne.getWarriorName(bluePosition) == "lion") {
lion theLion(blueOne.getCount(), blueOne.getWarriorValue(bluePosition), blueOne.getLifeValue());
theLion.print();
} else {
wolf theWolf(blueOne.getCount(), blueOne.getWarriorValue(bluePosition));
} if (bluePosition == ? bluePosition = : bluePosition++);
break;
}
else
{
if (bluePosition == ? bluePosition = : bluePosition++);
}
}
}
} } } return ;
}