注意：總時間限制: 1000ms 內存限制: 65536kB

描述

魔獸世界的西面是紅魔軍的司令部，東面是藍魔軍的司令部。兩個司令部之間是依次排列的若干城市。
紅司令部，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分開始到雙方司令部停止製造武士爲止的所有事件按順序輸出。

一共有兩種事件，其對應的輸出樣例如下：

武士降生
輸出樣例： 004 blue lion 5 born with strength 5,2 lion in red headquarter
表示在4點整，編號爲5的藍魔lion武士降生，它降生時生命值爲5，降生後藍魔司令部裏共有2個lion武士。（爲簡單起見，不考慮單詞的複數形式）注意，每製造出一個新的武士，都要輸出此時司令部裏共有多少個該種武士。
司令部停止製造武士
輸出樣例： 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>

using namespace std;

class Dragon {
private:
    int strength = 0;
public:
    void set_strength(int strength_) {
        strength = strength_;
    }

    int getStrength() {
        return strength;
    }
};

class Ninja {
private:
    int strength = 0;
public:
    void set_strength(int strength_) {
        strength = strength_;
    }

    int getStrength() {
        return strength;
    }
};

class Iceman {
private:
    int strength = 0;
public:
    void set_strength(int strength_) {
        strength = strength_;
    }

    int getStrength() {
        return strength;
    }
};

class Lion {
private:
    int strength = 0;
public:
    void set_strength(int strength_) {
        strength = strength_;
    }

    int getStrength() {
        return strength;
    }
};

class Wolf {
private:
    int num_red = 0, num_blue = 0;
    int strength = 0;
public:
    void set_strength(int strength_) {
        strength = strength_;
    }

    int getStrength() {
        return strength;
    }
};


class Red {
private:
    int dragonNum = 0, ninjaNum = 0, icemanNum = 0, lionNum = 0, wolfNum = 0;
    int barrackStrength = 0;
    char previousSamurai = '\0';
public:
    void add_dragonNum() {
        dragonNum++;
    }

    void add_ninjaNum() {
        ninjaNum++;
    }

    void add_icemanNum() {
        icemanNum++;
    }

    void add_lionNum() {
        lionNum++;
    }

    void add_wolfNum() {
        wolfNum++;
    }

    void set_initial_strength(int strength) {
        barrackStrength = strength;
    }

    void cost_barrack_strength(int cost) {
        barrackStrength -= cost;
    }

    void set_previous_samurai(char name) {
        previousSamurai = name;
    }

    int get_dragonNum() {
        return dragonNum;
    }

    int get_ninjaNum() {
        return ninjaNum;
    }

    int get_icemanNum() {
        return icemanNum;
    }

    int get_lionNum() {
        return lionNum;
    }

    int get_wolfNum() {
        return wolfNum;
    }

    int get_barrackStrength() {
        return barrackStrength;
    }

    char get_previous_samurai() {
        return previousSamurai;
    }

    int getSum() {
        return dragonNum + ninjaNum + icemanNum + lionNum + wolfNum;
    }
};

class Blue {
private:
    int dragonNum = 0, ninjaNum = 0, icemanNum = 0, lionNum = 0, wolfNum = 0;
    int barrackStrength = 0;
    char previousSamurai = '\0';
public:
    void add_dragonNum() {
        dragonNum++;
    }

    void add_ninjaNum() {
        ninjaNum++;
    }

    void add_icemanNum() {
        icemanNum++;
    }

    void add_lionNum() {
        lionNum++;
    }

    void add_wolfNum() {
        wolfNum++;
    }

    void set_initial_strength(int strength) {
        barrackStrength = strength;
    }

    void cost_barrack_strength(int cost) {
        barrackStrength -= cost;
    }

    void set_previous_samurai(char name) {
        previousSamurai = name;
    }

    int get_dragonNum() {
        return dragonNum;
    }

    int get_ninjaNum() {
        return ninjaNum;
    }

    int get_icemanNum() {
        return icemanNum;
    }

    int get_lionNum() {
        return lionNum;
    }

    int get_wolfNum() {
        return wolfNum;
    }

    int get_barrackStrength() {
        return barrackStrength;
    }

    char get_previous_samurai() {
        return previousSamurai;
    }

    int getSum() {
        return dragonNum + ninjaNum + icemanNum + lionNum + wolfNum;
    }
};

class Genaration {
private:
    int time = 0;
    Red red;
    Blue blue;
    Dragon dragon;
    Ninja ninja;
    Iceman iceman;
    Lion lion;
    Wolf wolf;
    int red_situation = 0; //變成1說明已經紅色司令部停止製造武士
    int blue_situation = 0; //變成1說明已經藍色司令部停止製造武士
public:
    void genaration() {
//        cout << "red.get_previous_samurai() " << red.get_previous_samurai() << endl;
//        cout << "get_barrackStrength() " << red.get_barrackStrength() << endl;
//        cout << "dragon.getStrength() " << dragon.getStrength();
        do {
            if (red_situation == 1 && blue_situation == 1) {
                exit(1);
            } else {
                genaration_red();
                genaration_blue();
                time++;
            }
        } while (true);
    }


    void genaration_red() {
        if ((red.get_previous_samurai() == '\0' || red.get_previous_samurai() == 'd') &&
            iceman.getStrength() <= red.get_barrackStrength()) {
            red.add_icemanNum();
            red.cost_barrack_strength(iceman.getStrength());
            outline_red('i');
            red.set_previous_samurai('i');
        } else if (red.get_previous_samurai() == 'i' && lion.getStrength() <= red.get_barrackStrength()) {
            red.add_lionNum();
            red.cost_barrack_strength(lion.getStrength());
            outline_red('l');
            red.set_previous_samurai('l');
        } else if (red.get_previous_samurai() == 'l' && wolf.getStrength() <= red.get_barrackStrength()) {
            red.add_wolfNum();
            red.cost_barrack_strength(wolf.getStrength());
            outline_red('w');
            red.set_previous_samurai('w');
        } else if (red.get_previous_samurai() == 'w' && ninja.getStrength() <= red.get_barrackStrength()) {
            red.add_ninjaNum();
            red.cost_barrack_strength(ninja.getStrength());
            outline_red('n');
            red.set_previous_samurai('n');
        } else if (red.get_previous_samurai() == 'n' && dragon.getStrength() <= red.get_barrackStrength()) {
            red.add_dragonNum();
            red.cost_barrack_strength(dragon.getStrength());
            outline_red('d');
            red.set_previous_samurai('d');
        } else if (red_situation == 1) { ;
        } else {
            outline_stop_red();
            red_situation = 1;
        }
    };

    void genaration_blue() {
        if ((blue.get_previous_samurai() == '\0' || blue.get_previous_samurai() == 'w') &&
            lion.getStrength() <= blue.get_barrackStrength()) {
            blue.add_lionNum();
            blue.cost_barrack_strength(lion.getStrength());
            outline_blue('l');
            blue.set_previous_samurai('l');
        } else if (blue.get_previous_samurai() == 'l' && dragon.getStrength() <= blue.get_barrackStrength()) {
            blue.add_dragonNum();
            blue.cost_barrack_strength(dragon.getStrength());
            outline_blue('d');
            blue.set_previous_samurai('d');
        } else if (blue.get_previous_samurai() == 'd' && ninja.getStrength() <= blue.get_barrackStrength()) {
            blue.add_ninjaNum();
            blue.cost_barrack_strength(ninja.getStrength());
            outline_blue('n');
            blue.set_previous_samurai('n');
        } else if (blue.get_previous_samurai() == 'n' && iceman.getStrength() <= blue.get_barrackStrength()) {
            blue.add_icemanNum();
            blue.cost_barrack_strength(iceman.getStrength());
            outline_blue('i');
            blue.set_previous_samurai('i');
        } else if (blue.get_previous_samurai() == 'i' && wolf.getStrength() <= blue.get_barrackStrength()) {
            blue.add_wolfNum();
            blue.cost_barrack_strength(wolf.getStrength());
            outline_blue('w');
            blue.set_previous_samurai('w');
        } else if (blue_situation == 1) { ;
        } else {
            outline_stop_blue();
            blue_situation = 1;
        }
    };

    void outline_red(char name) {
        outTime();
        cout << "red ";
        outline_choose_red(name);
        cout << endl;
    }

    void outline_blue(char name) {
        outTime();
        cout << "blue ";
        outline_choose_blue(name);
        cout << endl;
    }

    void outline_stop_red() {
        outTime();
        cout << "red headquarter stops making warriors" << endl;
    }

    void outline_stop_blue() {
        outTime();
        cout << "blue headquarter stops making warriors" << endl;
    }

    void outTime() {
        if (time < 10)
            cout << "00" << time << " ";
        else if (time < 100)
            cout << "0" << time << " ";
        else
            cout << time << " ";
    }

    void outline_choose_red(char name) {
        if (name == 'd')
            cout << "dragon " << red.getSum() << " " << "born with strength " << dragon.getStrength() << ","
                 << red.get_dragonNum() << " dragon in red headquarter";
        else if (name == 'n')
            cout << "ninja " << red.getSum() << " " << "born with strength " << ninja.getStrength() << ","
                 << red.get_ninjaNum() << " ninja in red headquarter";
        else if (name == 'i')
            cout << "iceman " << red.getSum() << " " << "born with strength " << iceman.getStrength() << ","
                 << red.get_icemanNum() << " iceman in red headquarter";
        else if (name == 'l')
            cout << "lion " << red.getSum() << " " << "born with strength " << lion.getStrength() << ","
                 << red.get_lionNum() << " lion in red headquarter";
        else
            cout << "wolf " << red.getSum() << " " << "born with strength " << wolf.getStrength() << ","
                 << red.get_wolfNum() << " wolf in red headquarter";
    }

    void outline_choose_blue(char name) {
        if (name == 'd')
            cout << "dragon " << blue.getSum() << " " << "born with strength " << dragon.getStrength() << ","
                 << blue.get_dragonNum() << " dragon in blue headquarter";
        else if (name == 'n')
            cout << "ninja " << blue.getSum() << " " << "born with strength " << ninja.getStrength() << ","
                 << blue.get_ninjaNum() << " ninja in blue headquarter";
        else if (name == 'i')
            cout << "iceman " << blue.getSum() << " " << "born with strength " << iceman.getStrength() << ","
                 << blue.get_icemanNum() << " iceman in blue headquarter";
        else if (name == 'l')
            cout << "lion " << blue.getSum() << " " << "born with strength " << lion.getStrength() << ","
                 << blue.get_lionNum() << " lion in blue headquarter";
        else
            cout << "wolf " << blue.getSum() << " " << "born with strength " << wolf.getStrength() << ","
                 << blue.get_wolfNum() << " wolf in blue headquarter";
    }

    void set_dragon_strength(int strength) {
        dragon.set_strength(strength);
    }

    void set_ninja_strength(int strength) {
        ninja.set_strength(strength);
    }

    void set_iceman_strength(int strength) {
        iceman.set_strength(strength);
    }

    void set_lion_strength(int strength) {
        lion.set_strength(strength);
    }

    void set_wolf_strength(int strength) {
        wolf.set_strength(strength);
    }

    void set_initial_strength(int strength) {
        red.set_initial_strength(strength);
        blue.set_initial_strength(strength);
    }
};

int main() {
    Genaration test;
    int testNum, dragonstrength, ninjastrength, icemanstrength, lionstrength, wolfstrength, barrackstrength;

    cin >> testNum;
    cin >> barrackstrength;
    scanf("%d %d %d %d %d", &dragonstrength, &ninjastrength, &icemanstrength, &lionstrength, &wolfstrength);
    test.set_dragon_strength(dragonstrength);
    test.set_ninja_strength(ninjastrength);
    test.set_iceman_strength(icemanstrength);
    test.set_lion_strength(lionstrength);
    test.set_wolf_strength(wolfstrength);
    test.set_initial_strength(barrackstrength);

    cout << "Case:" << testNum << endl;
    test.genaration();
}

修改解答

看了郭老師給出的代碼之後，在其基礎上重新寫了一次。代碼量明顯小了不少：

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
const int  WARRIOR_NUM = 5;
/*
string Warrior::names[WARRIOR_NUM] = { "dragon","ninja","iceman","lion","wolf" };
紅方司令部按照 iceman、lion、wolf、ninja、dragon 的順序製造武士。
藍方司令部按照 lion、dragon、ninja、iceman、wolf 的順序製造武士。
*/
 
class Headquarter;
class Warrior
{
	private:
		Headquarter * pHeadquarter;
		int kindNo; //武士的種類編號 0 dragon 1 ninja 2 iceman 3 lion 4 wolf
		int no;
	public:
		static string names[WARRIOR_NUM];
		static int initialLifeValue [WARRIOR_NUM];
		Warrior( Headquarter * p,int no_,int kindNo_ );
		void PrintResult(int nTime);
};
 
class Headquarter
{
	private:
		int totalLifeValue;
		bool stopped;
		int totalWarriorNum;
		int color;
		int curMakingSeqIdx; //當前要製造的武士是製造序列中的第幾個
		int warriorNum[WARRIOR_NUM]; //存放每種武士的數量
		Warrior * pWarriors[1000];
	public:
		friend class Warrior;
		static int makingSeq[2][WARRIOR_NUM]; //武士的製作順序序列
		void Init(int color_, int lv);
		~Headquarter () ;
		int Produce(int nTime);
		string GetColor();
 
};
 
 
Warrior::Warrior( Headquarter * p,int no_,int kindNo_ ) {
	no = no_;
	kindNo = kindNo_;
	pHeadquarter = p;
}
 
void Warrior::PrintResult(int nTime)
{
    string color =  pHeadquarter->GetColor();
    printf("%03d %s %s %d born with strength %d,%d %s in %s headquarter\n"	,
        nTime, color.c_str(), names[kindNo].c_str(), no, initialLifeValue[kindNo],
        pHeadquarter->warriorNum[kindNo],names[kindNo].c_str(),color.c_str());
}
 
void Headquarter::Init(int color_, int lv)
{
	color = color_;
	totalLifeValue = lv;
	totalWarriorNum = 0;
	stopped = false;
	curMakingSeqIdx = 0;
	for( int i = 0;i < WARRIOR_NUM;i++ )
		warriorNum[i] = 0;
}
 
Headquarter::~Headquarter () {
	for( int i = 0;i < totalWarriorNum;i++ )
		delete pWarriors[i];
}
 
int Headquarter::Produce(int nTime)
{
 
	if( stopped )
		return 0;
	int searchingTimes = 0;
	while( Warrior::initialLifeValue[makingSeq[color][curMakingSeqIdx]] > totalLifeValue &&
		searchingTimes < WARRIOR_NUM ) {
		curMakingSeqIdx = ( curMakingSeqIdx + 1 ) % WARRIOR_NUM;
		searchingTimes++;
	}
	int kindNo = makingSeq[color][curMakingSeqIdx];
	if( Warrior::initialLifeValue[kindNo] > totalLifeValue ) {
		stopped = 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 -= Warrior::initialLifeValue[kindNo];
	curMakingSeqIdx = ( curMakingSeqIdx + 1 ) % WARRIOR_NUM;
	pWarriors[totalWarriorNum] = new Warrior( this,totalWarriorNum+1,kindNo);
	warriorNum[kindNo]++;
	pWarriors[totalWarriorNum]->PrintResult(nTime);
	totalWarriorNum++;
	return 1;
}
 
string Headquarter::GetColor()
{
	if( color == 0)
		return "red";
	else
		return "blue";
}
 
string Warrior::names[WARRIOR_NUM] = { "dragon","ninja","iceman","lion","wolf" };
int Warrior::initialLifeValue [WARRIOR_NUM];
int Headquarter::makingSeq[2][WARRIOR_NUM] = { { 2,3,4,1,0 },{3,0,1,2,4} }; //兩個司令部武士的製作順序序列
 
int main()
{
	int t;
	int m;
	Headquarter RedHead,BlueHead;
	scanf("%d",&t);
	int nCaseNo = 1;
	while ( t-- ) {
		printf("Case:%d\n",nCaseNo++);
		scanf("%d",&m);
		for( int i = 0;i < WARRIOR_NUM;i++ )
			scanf("%d", & Warrior::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;
}

C++：編程題：魔獸世界之一：備戰

描述

初始解答

修改解答

vue項目獲取富文本編輯器wangEditor內容導出爲word（html轉word格式並下載）

dotnet C# 創建 X11 應用時設置窗口背景顏色

TDengine docker安裝方法

vue3組件通信與props

sapui5

Alpine Linux apk add DNS lookup error

部分JDK版本的發佈時間

工作中用到的腳本合集

合併代碼時Beyond Compare設置

go語言 defer延遲機制

利用按鍵精靈實現QQ羣發和微信羣發

酷比魔方iWork10pro安卓root+單系統+雙系統恢復教程（理論適配所有x86安卓root）

2018年度C語言/VB作業參考解答集合

按鍵精靈實現自動化點qq名片贊

C++數據結構：單鏈表、雙鏈表與循環鏈表

https://yachay.unat.edu.pe/blog/index.php?comment_area=format_blog&comment_component=blog&comment_co

linux以太網驅動總結