魔兽世界之二:装备
魔兽世界的西面是红魔军的司令部,东面是蓝魔军的司令部。两个司令部之间是依次排列的若干城市。
红司令部,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所需的生命元数量。
ninja可以拥有两件武器。编号为n的ninja降生时即获得编号为 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分开始到双方司令部停止制造武士为止的所有事件按顺序输出。
一共有两种事件,其对应的输出样例如下:
说实话,以上的题目描述真的很让人头疼,毕竟也太长了,但读完之后发现就是篇科普读物啊!!
此处开始重要环节,
之前的皆为废话(bushi)
- 武士降生
输出样例: 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位,四舍五入(第一坑)
如果造出的是ninja,那么还要输出一行,例:
It has a bomb and a arrow
表示该ninja降生时得到了bomb和arrow。
如果造出的是iceman,那么还要输出一行,例:
It has a sword
表示该iceman降生时得到了sword。
如果造出的是lion,那么还要输出一行,例:
It’s loyalty is 24
表示该lion降生时的忠诚度是24。- 司令部停止制造武士
输出样例: 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
思路分析
总的说来,本题思路沿袭魔兽世界一备战的处理方法,采用类实现对象的操作,而其中考察了派生类的使用,但也可以选择其他方法,借用其他数据结构也可达到同样效果,本题解旨在加深继承的概念,同时赚点人气~~(也有可能是气人,哈哈)~~话不多说,先提供AC代码,文末给出另一种思路求解的链接。
#include<iostream>
#include<iomanip>
#include<cstring>
using namespace std;
string Warrior[5] = { "dragon","ninja","iceman","lion","wolf" };
int Red[5] = { 2,3,4,1,0 };
int Blue[5] = { 3,0,1,2,4 };//红蓝方生产士兵的顺序
string weapon[3] = { "sword","bomb","arrow" };
int Cost[5], en;//cost存储每个武士的生产费用,en描述是否双方生产结束
class warrior {
public:
int num, percost;
int name;
warrior() :percost(0), num(0), name(0) {};
warrior(int percost_, int name_) :percost(percost_), name(name_), num(0) {};
};
class dragon: public warrior {
public:
int armor;
float morale;
dragon(int percost_, int name_, int num_ = 0, float morale_ = 0) :warrior(percost_, name_), morale(0.0), armor(0) {};
dragon() :warrior(), armor(0), morale(0.0) {};
void refresh(int n, int hp) {
num++;
armor = n % 3;
morale = float(hp) / float(percost);
}
};
class ninja :public warrior {
public:
int armor1, armor2;
ninja(int percost_, int name_) :warrior(percost_, name_), armor1(0), armor2(0) {};
ninja() :warrior(), armor1(0), armor2(0) {};
void refresh(int n) {
num++;
armor1 = n % 3;
armor2 = (n + 1) % 3;
}
};
class iceman :public warrior {
public:
int armor;
iceman() :warrior(), armor(0) {};
iceman(int percost_, int name_) :warrior(percost_, name_), armor(0) {};
void refresh(int n) {
num++;
armor = n % 3; }
};
class lion :public warrior {
public:
int loyalty;
lion(int percost_, int name_) :warrior(percost_, name_), loyalty(0) {};
lion() :warrior(), loyalty(0) { };
void refresh(int hp) {
num++;
loyalty = hp;
}
};
class wolf :public warrior {
public:
wolf() :warrior() {};
wolf(int percost_, int name_) :warrior(percost_, name_) {};
void refresh() {
num++;
}
};
class Camp {
string Id;//阵营名字
int num, tn, keep;//keep判断生产是否继续,num为时间数,num+1为编号,tn记录生成进行所至的武士相应编号
int hp;//Id为阵营名称,num为武士编号
dragon dra; ninja nin; iceman ice; lion lio; wolf wol;
public:
Camp() :Id(""),num(0),tn(0),keep(0),hp(0){};
Camp(string c, int n, int b = 0) {
Id = c;
hp = n;
num = -1;
tn = b;
keep = 0;
if (c == "red") {
for (int i = 0; i < 5; i++) {
switch (i) {
case 0:ice=iceman(Cost[Red[i]], Red[i]); break;
case 1:lio=lion(Cost[Red[i]], Red[i]); break;
case 2:wol=wolf(Cost[Red[i]], Red[i]); break;
case 3:nin=ninja(Cost[Red[i]], Red[i]); break;
case 4:dra=dragon(Cost[Red[i]], Red[i]); break;
}
}
}
else {
for (int i = 0; i < 5; i++) {
switch (i) {
case 0:lio=lion(Cost[Blue[i]], Blue[i]); break;
case 1:dra=dragon(Cost[Blue[i]], Blue[i]); break;
case 2:nin=ninja(Cost[Blue[i]], Blue[i]); break;
case 3:ice=iceman(Cost[Blue[i]], Blue[i]); break;
case 4:wol=wolf(Cost[Blue[i]], Blue[i]); break;
}
}
}
};
void redproduce() {
int flag = 0, t = 0, tem = tn;
while (t < 5 && flag == 0) {
if (hp > 0) {
switch (tem) {
case 0:if (hp>= ice.percost) { hp -= ice.percost, ice.refresh(num + 2), flag = 1, tn = tem; }; break;
case 1:if (hp>=lio.percost) { hp -= lio.percost, lio.refresh(hp), flag = 1, tn = tem; }; break;
case 2:if (hp>= wol.percost) { hp -= wol.percost, wol.refresh(), flag = 1, tn = tem; }; break;
case 3:if (hp>= nin.percost) { hp -= nin.percost, nin.refresh(num + 2), flag = 1, tn = tem; }; break;
case 4:if (hp>= dra.percost) { hp -= dra.percost, dra.refresh(num + 2, hp), flag = 1, tn = tem; }; break;
}
}
if(flag==0) {
t++;
tem = (tem + 1) % 5;
}
};
num++;
if (t == 5 && flag == 0)Print2();
else redPrint1(tem);
}
void blueproduce() {
int flag = 0, t = 0, tem = tn;
while (t < 5 && flag == 0) {
if (hp > 0) {
switch (tem) {
case 0:if (hp>= lio.percost) { hp -= lio.percost, lio.refresh(hp), flag = 1, tn = tem; }; break;
case 1:if (hp>= dra.percost) { hp -= dra.percost, dra.refresh(num + 2, hp), flag = 1, tn = tem; }; break;
case 2:if (hp>= nin.percost) { hp -= nin.percost, nin.refresh(num + 2), flag = 1, tn = tem; }; break;
case 3:if (hp>=ice.percost) { hp -= ice.percost, ice.refresh(num + 2), flag = 1, tn = tem; }; break;
case 4:if (hp>= wol.percost) { hp -= wol.percost, wol.refresh(), flag = 1, tn = tem; }; break;
}
}
if (flag == 0) {
t++;
tem = (tem + 1) % 5;
}
}
num++;
if (t == 5 && flag == 0)Print2();
else bluePrint1(tem);
}
void out(const warrior& c) {
cout << setw(3) << setfill('0') << num << " " << Id << " " << Warrior[c.name] << " " << num + 1 << " born with strength " <<c.percost << "," << c.num << " " << Warrior[c.name] << " in " << Id << " headquarter" << endl;
return;
}
void bluePrint1(int i) {
switch (i) {
case 0:out(lio), cout << "It's loyalty is " << lio.loyalty << endl; break;
case 1:out(dra), cout << "It has a " << weapon[dra.armor] << ",and it's morale is " <<fixed<<setprecision(2)<< dra.morale << endl; break;
case 2:out(nin), cout << "It has a " << weapon[nin.armor1] << " and a " << weapon[nin.armor2] << endl; break;
case 3:out(ice), cout << "It has a " << weapon[ice.armor] << endl; break;
case 4:out(wol); break;
}
tn = (tn + 1) % 5;
}
void redPrint1(int i) {
switch (i) {
case 0:out(ice), cout << "It has a " << weapon[ice.armor] << endl; break;
case 1:out(lio), cout << "It's loyalty is " << lio.loyalty << endl; break;
case 2:out(wol); break;
case 3:out(nin), cout << "It has a " << weapon[nin.armor1] << " and a " << weapon[nin.armor2] << endl; break;
case 4:out(dra), cout << "It has a " << weapon[dra.armor] << ",and it's morale is " <<fixed<<setprecision(2)<< dra.morale << endl; break;
}
tn = (tn + 1) % 5;
}
void Print2() {
cout << setw(3) << setfill('0') << num << " " << Id << " headquarter stops making warriors" << endl;
keep = 1;
en++;
}
friend void loop();
};
Camp r, b;
void loop() {
while (en < 2) {
if (r.keep == 0)r.redproduce();
if (b.keep == 0)b.blueproduce();
}
}
int main() {
int t, m, i = 1;
cin >> t;
while (i <= t) {
en = 0;
memset(Cost, 0, sizeof(Cost));
cin >> m;
for (int i = 0; i < 5; i++)cin >> Cost[i];
r = Camp("red", m);
b = Camp("blue", m);
cout << "Case:" << i << endl;
loop();
i++;
}
}
代码虽长,但实现效果还挺好的~~(求别拆穿)~~
最后,附上另一解法的链接感兴趣的可以点击去看