C++编程练习 013:魔兽世界之一：备战

北大程序设计与算法（三）测验题汇总(2020春季)

---

描述

魔兽世界的西面是红魔军的司令部，东面是蓝魔军的司令部。两个司令部之间是依次排列的若干城市。
红司令部，City 1，City 2，……，City n，蓝司令部

两军的司令部都会制造武士。武士一共有 dragon 、ninja、iceman、lion、wolf 五种。每种武士都有编号、生命值、攻击力这三种属性。

双方的武士编号都是从1开始计算。红方制造出来的第n个武士，编号就是n。同样，蓝方制造出来的第n个武士，编号也是n。

武士在刚降生的时候有一个生命值。

在每个整点，双方的司令部中各有一个武士降生。

红方司令部按照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武士。（为简单起见，不考虑单词的复数形式）注意，每制造出一个新的武士，都要输出此时司令部里共有多少个该种武士。

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
000 blue lion 1 born with strength 6,1 lion in blue headquarter
001 red lion 2 born with strength 6,1 lion in red headquarter
001 blue dragon 2 born with strength 3,1 dragon in blue headquarter
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
003 red headquarter stops making warriors
003 blue iceman 4 born with strength 5,1 iceman in blue headquarter
004 blue headquarter stops making warriors

---

思路分析

按照简单的来说，建立两个类即可，第一个类是武士，第二个类是司令部，并且让司令部拥有武士类即可。因为这个只是开始部分，一共三个部分，为了后续的扩展，在此使用了比较复杂的结构
士兵类 – > 具体化某种士兵 --> 司令部

---

代码此处提供两个版本
复杂版本：

#include<iostream>
#include<iomanip>
using namespace std;
constexpr auto Maxsize = 10001;//武士的最大数量
enum{red,blue};//两个司令部，0->red，1->blue
int propaganda_wrrior_lifelong[5];//五种武士的生命值
class Header_part;
class Wrrior {
protected:
    int wrrior_life_value;//生命值
    int wrrior_num;//编号
    int kind;//类别dragon 、ninja、iceman、lion、wolf 
public:
    Wrrior(){ }
    Wrrior(int wrrior_num, int wrrior_life_value) {
        this->wrrior_num = wrrior_num;
        this->wrrior_life_value = wrrior_life_value;
        this->kind = kind;
    }
    virtual void show() = 0;
    ~Wrrior(){ }
};
class dragon :public Wrrior {
    int kind;
public:
    dragon(int kind, int wrrior_num, int wrrior_life_value) :Wrrior(wrrior_num, wrrior_life_value) {this->kind = kind;}
    void show() {
        if (this->kind == 0)
            cout << "red ";
        else
            cout << "blue ";
        cout << "dragon " << wrrior_num << "born with strength " << propaganda_wrrior_lifelong[0] << ",";
    }
    ~dragon(){ }
};
class ninja :public Wrrior {
    int kind;
public: 
    ninja(int kind,int wrrior_num, int wrrior_life_value) :Wrrior(wrrior_num, wrrior_life_value) { this->kind = kind; }
    void show() {
        if (this->kind == 0)
            cout << "red ";
        else
            cout << "blue ";
        cout << "ninja " << wrrior_num << "born with strength " << propaganda_wrrior_lifelong[1] << "," ;
    }
    ~ninja(){ }
};
class iceman :public Wrrior {
    int kind;
public:
    iceman(int kind, int wrrior_num, int wrrior_life_value) :Wrrior(wrrior_num, wrrior_life_value) {this->kind = kind;}
    void show() {
        if (this->kind == 0)
            cout << "red ";
        else
            cout << "blue ";
        cout << "iceman " << wrrior_num << "born with strength " << propaganda_wrrior_lifelong[2] << "," ;
    }
    ~iceman(){ }
};
class lion :public Wrrior {
    int kind;
public:
    lion(int kind, int wrrior_num, int wrrior_life_value) :Wrrior( wrrior_num, wrrior_life_value) { this->kind = kind; }
    void show() {
        if (this->kind == 0)
            cout << "red ";
        else
            cout << "blue ";
        cout << "lion " << wrrior_num << "born with strength " << propaganda_wrrior_lifelong[3] << ",";
    }
    ~lion(){ }
};
class wolf :public Wrrior {
    int kind;
public:
    wolf(int kind,int wrrior_num, int wrrior_life_value) :Wrrior(wrrior_num, wrrior_life_value) {}
    void show() {
        if (this->kind == 0)
            cout << "red ";
        else
            cout << "blue ";
        cout << "wolf " << wrrior_num << "born with strength " << propaganda_wrrior_lifelong[4] << "," ;
    }
    ~wolf(){ }
};
class Header_part {
private:
    static const char *priminary_order[5];//武士种类
    static int propaganda_order[2][5];
    int total_wrrior_num;//武士总的数量
    Wrrior *solidier[Maxsize];//储存产生的武士
    int wrrior_kind;//武士类别辨识
    int every_wrrior_num[5] = {0};//每一个武士的数量统计
    int total_life_value;//总的剩余生命值
public:
    Header_part(int &total_life_value) {
        this->total_life_value = total_life_value;
        this->total_wrrior_num = 0;
        this->wrrior_kind = 0;//从第一号武士开始产生
    }
    bool produce_wrrior(int header_kind)//司令部类别辨识 
    {
        if (total_life_value <= 0)//生命值耗尽
            return false;
        int now_wrrior,temp_wrrior_kind = this->wrrior_kind;
        while (1) {
            now_wrrior = propaganda_order[header_kind][wrrior_kind];
            if (propaganda_wrrior_lifelong[now_wrrior] <= total_life_value) {
                switch (now_wrrior) {
                case 0:solidier[total_wrrior_num] = new dragon(header_kind,total_wrrior_num + 1, propaganda_wrrior_lifelong[now_wrrior]);
                    break;
                case 1:solidier[total_wrrior_num] = new ninja(header_kind,total_wrrior_num + 1, propaganda_wrrior_lifelong[now_wrrior]);
                    break;
                case 2:solidier[total_wrrior_num] = new iceman(header_kind,total_wrrior_num + 1, propaganda_wrrior_lifelong[now_wrrior]);
                    break;
                case 3:solidier[total_wrrior_num] = new lion(header_kind,total_wrrior_num + 1, propaganda_wrrior_lifelong[now_wrrior]);
                    break;
                case 4:solidier[total_wrrior_num] = new wolf(header_kind,total_wrrior_num + 1, propaganda_wrrior_lifelong[now_wrrior]);
                    break;
                default:break;
                }
                break;//已经匹配适合生产的武士，跳出循环
            }
            else//未匹配适合的武士时
                wrrior_kind = (wrrior_kind + 1) % 5;
            if (temp_wrrior_kind == wrrior_kind)//已经循环一遍了未找到能够满足生命值的武士
                return false;
        }
        ++every_wrrior_num[now_wrrior];//该种类武士数量增加
        ++total_wrrior_num;//该司令部武士数量增加一
        solidier[total_wrrior_num - 1]->show();
        cout << every_wrrior_num[now_wrrior] << " " << priminary_order[now_wrrior];
        if (header_kind == 0)
            cout << " in red headquarter"<<endl;
        else
            cout <<" in blue headquarter" << endl;
        wrrior_kind = (wrrior_kind + 1) % 5;//准备下一个即将产生的武士
        total_life_value -= propaganda_wrrior_lifelong[now_wrrior];//生命值减少
        return true;
    }
    ~Header_part(){ }
};
int Header_part::propaganda_order[2][5] = { {2,3,4,1,0},{3,0,1,2,4}};//两个司令部的武士产生顺序
const char *Header_part::priminary_order[5] = {"dragon ","ninja","iceman","lion","wolf " };
int main()
{
    int M, group_num;//组数，每组内部编号
    cin >> M;
    int total_value_lifelong = 0;
    for(int i = 1;i <= M;i++){
        int tag1 = 1, tag2 = 1;
        group_num = 0;
        cin >> total_value_lifelong;
        Header_part redhead(total_value_lifelong), bluehead(total_value_lifelong);//两个司令部初始化
        for (int i = 0; i <= 4; i++)
            cin >> propaganda_wrrior_lifelong[i];//生命值输入
        cout << "Case:" << i << endl;
        while (tag1 + tag2 != 4)
        {
            if (tag1 == 1) {
                cout << setfill('0') << right << setw(3) << group_num << " ";
                tag1 = redhead.produce_wrrior(red);
            }
            if (tag1 == 0)
            {
                cout << "red headquarter stops making warriors" << endl;
                tag1 = 2;
            }
            if (tag2 == 1){
                cout << setfill('0') << right << setw(3) << group_num << " ";
                tag2 = bluehead.produce_wrrior(blue);
            }
            if (tag2 == 0)
            {
                cout << "blue headquarter stops making warriors" << endl;
                tag2 = 2;
            }
            ++group_num;
        }
    }
    return 0;
}

官方简要版本
主要就是两个类，武士类，司令部类，满足目前需求即可

#include <iostream> 
#include <cstring> 
using namespace std; 
#define WARRIOR_NUM 5
//char * CWarrior::names[WARRIOR_NUM] = { "dragon","ninja","iceman","lion","wolf" };
class CHeadquarter;
class CWarrior
{
private:
	CHeadquarter * pHeadquarter;
	int kindNo; //武士的种类编号 0 dragon 1 ninja 2 iceman 3 lion 4 wolf
	int nNo;
public:
	static char * names[WARRIOR_NUM];
	static int InitialLifeValue [WARRIOR_NUM];
	CWarrior( CHeadquarter * p,int nNo_,int kindNo_ ):nNo(nNo_),kindNo(kindNo_),pHeadquarter(p) { }
	void PrintResult(int nTime)	;	
};
class CHeadquarter
{
private:
	int totalLifeValue;
	bool bStopped;
	int totalWarriorNum;
	int color;
	int curMakingSeqIdx; //当前要制造的武士是制造序列中的第几个
	int warriorNum[WARRIOR_NUM]; //存放每种武士的数量
	CWarrior * pWarriors[1000];
public:
	friend class CWarrior;
	static int makingSeq[2][WARRIOR_NUM]; //武士的制作顺序序列
	void Init(int color_, int lv)
	{
		color = color_;
		totalLifeValue = lv;
		totalWarriorNum = 0;
		bStopped = false;
		curMakingSeqIdx = 0;
		for( int i = 0;i < WARRIOR_NUM;i ++ ) 
			warriorNum[i] = 0;
	} 
	~CHeadquarter () {
	for( int i = 0;i < totalWarriorNum;i ++ )
		 delete pWarriors[i];
	} 
	int Produce(int nTime){
		if( bStopped ) 
			return 0;
		int nSearchingTimes = 0;
		while( CWarrior::InitialLifeValue[makingSeq[color][curMakingSeqIdx]] >totalLifeValue && nSearchingTimes < WARRIOR_NUM )
		{
			curMakingSeqIdx = ( curMakingSeqIdx + 1 ) % WARRIOR_NUM ;
			nSearchingTimes ++;
		} 
		int kindNo = makingSeq[color][curMakingSeqIdx];
		if( CWarrior::InitialLifeValue[kindNo] > totalLifeValue )
		{
			bStopped = true;
			if( color == 0) 
				printf("%03d red headquarter stops making warriors\n",nTime);
			else 
				printf("%03d blue headquarter stops making warriors\n",nTime); 
			return 0;
		}
		totalLifeValue -= CWarrior::InitialLifeValue[kindNo];
		curMakingSeqIdx = ( curMakingSeqIdx + 1 ) % WARRIOR_NUM ;
		pWarriors[totalWarriorNum] = new CWarrior( this,totalWarriorNum+1,kindNo);
		warriorNum[kindNo]++;
		pWarriors[totalWarriorNum]->PrintResult(nTime);
		totalWarriorNum ++;
		return 1;
	} 
	void GetColor( char * szColor){
		if( color == 0) 
			strcpy(szColor,"red");
		else 
			strcpy(szColor,"blue");
	} 
};
void CWarrior::PrintResult(int nTime)	
{
	char szColor[20];
	pHeadquarter->GetColor(szColor);
	printf("%03d %s %s %d born with strength %d,%d %s in %s headquarter\n",nTime, szColor, names[kindNo], nNo, InitialLifeValue[kindNo], pHeadquarter->warriorNum[kindNo],names[kindNo],szColor);		
}
char * CWarrior::names[WARRIOR_NUM] = { "dragon","ninja","iceman","lion","wolf" };
int CWarrior::InitialLifeValue [WARRIOR_NUM];
int CHeadquarter::makingSeq[2][WARRIOR_NUM] = { { 2,3,4,1,0 },{3,0,1,2,4}};
int main()
{
	int t;
	int m;
	CHeadquarter RedHead,BlueHead;
	int nCaseNo = 1;
	scanf("%d",&t);
	while ( t -- ) {
		printf("Case:%d\n",nCaseNo++); 
		scanf("%d",&m);
		for( int i = 0;i < WARRIOR_NUM;i ++ ) 
			scanf("%d", & CWarrior::InitialLifeValue[i]);
		RedHead.Init(0,m);
		BlueHead.Init(1,m);
		int nTime = 0;
		while( true) { 
			int tmp1 = RedHead.Produce(nTime); 
			int tmp2 = BlueHead.Produce(nTime); 
			if( tmp1 == 0 && tmp2 == 0) 
				break;
			nTime ++; 
		}
	}
	return 0;		
}