这个版本写得很菜,很多地方还可以优化(以后的版本再重写好了2333333)
魔兽世界之一：备战
总时间限制:
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分开始到双方司令部停止制造武士为止的所有事件按顺序输出。
一共有两种事件，其对应的输出样例如下：
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 <cstdio>
#include <string>
#include <algorithm>
using namespace std;
class warrior{
public:
int n, hp, atk;
warrior(int n, int hp, int atk){
this->n = n;
this->hp = hp;
this->atk = atk;
}
};
class dragon:public warrior{
public:
static int r_number;
static int b_number;
int flag;
dragon(int n_t,int hp_t,int atk_t,int flag_t):warrior(n_t,hp_t,atk_t){
flag=flag_t;
if(flag==0){//0代表red一方
r_number++;
}else{
b_number++;
}
}
void print(int n){
if(flag==0)
printf("dragon %d born with strength %d,%d dragon in red headquarter\n", n, hp, r_number);
else
printf("dragon %d born with strength %d,%d dragon in blue headquarter\n", n, hp, b_number);
}
};
class ninja :public warrior{
public:
static int r_number;
static int b_number;
int flag;
ninja(int n_t,int hp_t,int atk_t,int flag_t):warrior(n_t,hp_t,atk_t){
flag=flag_t;
if(flag==0){//0代表red一方
r_number++;
}else{
b_number++;
}
}
void print(int n){
if(flag==0)
printf("ninja %d born with strength %d,%d ninja in red headquarter\n", n, hp, r_number);
else
printf("ninja %d born with strength %d,%d ninja in blue headquarter\n", n, hp, b_number);
}
};
class iceman :public warrior{
public:
static int r_number;
static int b_number;
int flag;
iceman(int n_t,int hp_t,int atk_t,int flag_t):warrior(n_t,hp_t,atk_t){
flag=flag_t;
if(flag==0){//0代表red一方
r_number++;
}else{
b_number++;
}
}
void print(int n){
if(flag==0)
printf("iceman %d born with strength %d,%d iceman in red headquarter\n", n, hp, r_number);
else
printf("iceman %d born with strength %d,%d iceman in blue headquarter\n", n, hp, b_number);
}
};
class lion :public warrior{
public:
static int r_number;
static int b_number;
int flag;
lion(int n_t,int hp_t,int atk_t,int flag_t):warrior(n_t,hp_t,atk_t){
flag=flag_t;
if(flag==0){//0代表red一方
r_number++;
}else{
b_number++;
}
}
void print(int n){
if(flag==0)
printf("lion %d born with strength %d,%d lion in red headquarter\n", n, hp, r_number);
else
printf("lion %d born with strength %d,%d lion in blue headquarter\n", n, hp, b_number);
}
};
class wolf :public warrior{
public:
static int r_number;
static int b_number;
int flag;
wolf(int n_t,int hp_t,int atk_t,int flag_t):warrior(n_t,hp_t,atk_t){
flag=flag_t;
if(flag==0){//0代表red一方
r_number++;
}else{
b_number++;
}
}
void print(int n){
if(flag==0)
printf("wolf %d born with strength %d,%d wolf in red headquarter\n", n, hp, r_number);
else
printf("wolf %d born with strength %d,%d wolf in blue headquarter\n", n, hp, b_number);
}
};
int dragon::r_number = 0;
int ninja::r_number = 0;
int iceman::r_number = 0;
int lion::r_number = 0;
int wolf::r_number = 0;
int dragon::b_number = 0;
int ninja::b_number = 0;
int iceman::b_number = 0;
int lion::b_number = 0;
int wolf::b_number = 0;
int main()
{
int N;
scanf("%d",&N);
int cnt = 0;//case的编号
while (N--){
int m;//生命值
scanf("%d", &m);
int d, n, i, l, w;//所需生命值
scanf("%d %d %d %d %d", &d, &n, &i, &l, &w);
int min_hp = min(d, min(n, min(i, min(l, w))));
printf("Case:%d\n", ++cnt);
dragon::r_number = 0;
ninja::r_number = 0;
iceman::r_number = 0;
lion::r_number = 0;
wolf::r_number = 0;
dragon::b_number = 0;
ninja::b_number = 0;
iceman::b_number = 0;
lion::b_number = 0;
wolf::b_number = 0;
int r = m, b = m;//双方剩余生命值
int cnt_r=0,cnt_b=0;//整点时刻
int d_cnt = 0, n_cnt = 0, i_cnt = 0, l_cnt = 0, w_cnt = 0;//各种武士的编号
int r_end = 0, b_end = 0;//等于1时,表示已经无法再生成了
int r_i_ok = 0, r_l_ok = 0, r_w_ok = 0, r_n_ok=0, r_d_ok = 0;//轮换生成
int b_i_ok = 0, b_l_ok = 0, b_w_ok = 0, b_n_ok = 0, b_d_ok = 0;
int r_ok = 0, b_ok = 0;//等于1时,说明已经生成了一个,等于0时说明还没生成,此时才可以生成
while (1){
if (r_end == 1 && b_end == 1) break;//只有当无法生成时才跳出循环
r_ok = 0;
b_ok = 0;
if (r_ok == 0&&r>=min_hp){
if (r_i_ok == 1 && r_l_ok == 1 && r_w_ok == 1 && r_n_ok == 1 && r_d_ok == 1){
r_i_ok = 0;
r_l_ok = 0;
r_w_ok = 0;
r_n_ok = 0;
r_d_ok = 0;
}
if (r >= i&&r_ok == 0&&r_i_ok==0){//iceman
printf("%03d red ", cnt_r++);
r -= i;
iceman tmp(++i_cnt, i, 0,0);
tmp.print(cnt_r);
r_ok = 1;
r_i_ok = 1;
}
else if (r_i_ok == 0 && r < i) r_i_ok = 1;
if (r >= l&&r_ok == 0 && r_l_ok == 0){//lion
printf("%03d red ", cnt_r++);
r -= l;
lion tmp(++l_cnt, l, 0,0);
tmp.print(cnt_r);
r_ok = 1;
r_l_ok = 1;
}
else if (r_l_ok == 0 && r < l) r_l_ok = 1;
if (r >= w&&r_ok == 0&&r_w_ok==0){//wolf
printf("%03d red ", cnt_r++);
r -= w;
wolf tmp(++w_cnt, w, 0,0);
tmp.print(cnt_r);
r_ok = 1;
r_w_ok = 1;
}
else if (r_w_ok == 0 && r < w) r_w_ok = 1;
if (r >= n&&r_ok == 0&&r_n_ok==0){//ninja
printf("%03d red ", cnt_r++);
r -= n;
ninja tmp(++n_cnt, n, 0,0);
tmp.print(cnt_r);
r_ok = 1;
r_n_ok = 1;
}
else if (r_n_ok == 0 && r < n) r_n_ok = 1;
if (r >= d&&r_ok == 0&&r_d_ok==0){//dragon
printf("%03d red ", cnt_r++);
r -= d;
dragon tmp(++d_cnt, d, 0,0);
tmp.print(cnt_r);
r_ok = 1;
r_d_ok = 1;
}
else if (r_d_ok == 0 && r < d) r_d_ok = 1;
}else{
if (r_end == 0){
printf("%03d red ", cnt_r++);
printf("headquarter stops making warriors\n");
r_end = 1;
}
}
if (b_ok == 0&&b>=min_hp){
if(r_ok==0&&r_end==0) continue;
if (b_i_ok == 1 && b_l_ok == 1 && b_w_ok == 1 && b_n_ok == 1 && b_d_ok == 1){
b_i_ok = 0;
b_l_ok = 0;
b_w_ok = 0;
b_n_ok = 0;
b_d_ok = 0;
}
if (b >= l&&b_ok == 0&&b_l_ok==0){//lion
printf("%03d blue ", cnt_b++);
b -= l;
lion tmp(++l_cnt, l, 0,1);
tmp.print(cnt_b);
b_ok = 1;
b_l_ok = 1;
}
else if (b_l_ok == 0 && b < l) b_l_ok = 1;
if (b >= d&&b_ok == 0&&b_d_ok==0){//dragon
printf("%03d blue ", cnt_b++);
b -= d;
dragon tmp(++d_cnt, d, 0,1);
tmp.print(cnt_b);
b_ok = 1;
b_d_ok = 1;
}
else if (b_d_ok == 0 && b < d) b_d_ok = 1;
if (b >= n&&b_ok == 0&&b_n_ok==0){//ninja
printf("%03d blue ", cnt_b++);
b -= n;
ninja tmp(++n_cnt, n, 0,1);
tmp.print(cnt_b);
b_ok = 1;
b_n_ok = 1;
}
else if (b_n_ok == 0 && b < n) b_n_ok = 1;
if (b >= i&&b_ok == 0&&b_i_ok==0){//iceman
printf("%03d blue ", cnt_b++);
b -= i;
iceman tmp(++i_cnt, i, 0,1);
tmp.print(cnt_b);
b_ok = 1;
b_i_ok = 1;
}
else if (b_i_ok == 0 && b < i) b_i_ok = 1;
if (b >= w&&b_ok == 0&&b_w_ok==0){//wolf
printf("%03d blue ", cnt_b++);
b -= w;
wolf tmp(++w_cnt, w, 0,1);
tmp.print(cnt_b);
b_ok = 1;
b_w_ok = 1;
}
else if (b_w_ok == 0 && b < w) b_w_ok = 1;
}
else{
if (b_end == 0){
printf("%03d blue ", cnt_b++);
printf("headquarter stops making warriors\n");
b_end = 1;
}
}
}
}
return 0;
}
2031
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
