魔兽世界
来源:互联网 发布:印度 网络空间作战部队 编辑:程序博客网 时间:2024/06/09 19:43
- 描述
魔兽世界的西面是红魔军的司令部,东面是蓝魔军的司令部。两个司令部之间是依次排列的若干城市。
红司令部,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开始 。
接下来按恰当的顺序和格式输出所有事件。每个事件都以事件发生的时间开头,时间以小时为单位,有三位。 - 样例输入
1203 4 5 6 7
- 样例输出
Case:1000 red iceman 1 born with strength 5,1 iceman in red headquarter000 blue lion 1 born with strength 6,1 lion in blue headquarter001 red lion 2 born with strength 6,1 lion in red headquarter001 blue dragon 2 born with strength 3,1 dragon in blue headquarter002 red wolf 3 born with strength 7,1 wolf in red headquarter002 blue ninja 3 born with strength 4,1 ninja in blue headquarter003 red headquarter stops making warriors003 blue iceman 4 born with strength 5,1 iceman in blue headquarter004 blue headquarter stops making warriors
#include <iostream>#include <iomanip>//#include <string>using namespace std;class dragon{public: dragon(int f_SN,int f_life)//,int f_attack=0 { cout<<"dragon "<<f_SN<<" born with strength "<<f_life<<','; } };class ninja{public: ninja(int f_SN,int f_life) { cout<<"ninja "<<f_SN<<" born with strength "<<f_life<<','; } };class iceman{public: iceman(int f_SN,int f_life) { cout<<"iceman "<<f_SN<<" born with strength "<<f_life<<','; } };class lion{public: lion(int f_SN,int f_life) { cout<<"lion "<<f_SN<<" born with strength "<<f_life<<','; } };class wolf{public: wolf(int f_SN,int f_life) { cout<<"wolf "<<f_SN<<" born with strength "<<f_life<<','; } };class red{ int dragon_num,ninja_num,iceman_num,lion_num,wolf_num; int dragon_life,ninja_life,iceman_life,lion_life,wolf_life; int m; int SN; int state; public: red(int M,int dragon,int ninja,int iceman,int lion,int wolf) { SN=0; //80 state=0; dragon_num=0,ninja_num=0,iceman_num=0,lion_num=0,wolf_num=0; m=M; dragon_life=dragon; ninja_life =ninja; iceman_life=iceman; lion_life =lion; wolf_life =wolf; } int getstate() { return state; } void born() { cout<<"red "; switch(state) { case 0: state++; if(m>=iceman_life) {SN++;iceman im(SN,iceman_life);m-=iceman_life;iceman_num++; //100 cout<<iceman_num<<" iceman in red headquarter"<<endl; break;} case 1: state++; if(m>=lion_life) {SN++;lion li(SN,lion_life);m-=lion_life;lion_num++; cout<<lion_num<<" lion in red headquarter"<<endl; break;} case 2: state++; if(m>=wolf_life) {SN++;wolf wo(SN,wolf_life);m-=wolf_life;wolf_num++; cout<<wolf_num<<" wolf in red headquarter"<<endl; break;} case 3: state++; if(m>=ninja_life) {SN++;ninja ni(SN,ninja_life);m-=ninja_life;ninja_num++; cout<<ninja_num<<" ninja in red headquarter"<<endl; break;} case 4: if(m>=dragon_life) {SN++;dragon dr(SN,dragon_life);m-=dragon_life;dragon_num++; cout<<dragon_num<<" dragon in red headquarter"<<endl; state=0;break;} else { state=0; switch(state) { case 0: state++; if(m>=iceman_life) {SN++;iceman im(SN,iceman_life);m-=iceman_life;iceman_num++; //100 cout<<iceman_num<<" iceman in red headquarter"<<endl; break;} case 1: state++; if(m>=lion_life) {SN++;lion li(SN,lion_life);m-=lion_life;lion_num++; cout<<lion_num<<" lion in red headquarter"<<endl; break;} case 2: state++; if(m>=wolf_life) {SN++;wolf wo(SN,wolf_life);m-=wolf_life;wolf_num++; cout<<wolf_num<<" wolf in red headquarter"<<endl; break;} case 3: state++; if(m>=ninja_life) {SN++;ninja ni(SN,ninja_life);m-=ninja_life;ninja_num++; cout<<ninja_num<<" ninja in red headquarter"<<endl; break;} case 4: if(m>=dragon_life) {SN++;dragon dr(SN,dragon_life);m-=dragon_life;dragon_num++; cout<<dragon_num<<" dragon in red headquarter"<<endl; state=0;break;} else {cout<<"headquarter stops making warriors"<<endl;state++;break;} default:break; } }//{cout<<"headquarter stops making warriors";state++;break;} default:break; } }};class blue{ int dragon_num,ninja_num,iceman_num,lion_num,wolf_num; int dragon_life,ninja_life,iceman_life,lion_life,wolf_life; int m; int SN; int state;public: blue(int M,int dragon,int ninja,int iceman,int lion,int wolf) { SN=0; state=0; dragon_num=0,ninja_num=0,iceman_num=0,lion_num=0,wolf_num=0; m=M; dragon_life=dragon; ninja_life =ninja; iceman_life=iceman; lion_life =lion; wolf_life =wolf; } int getstate() { return state; } void born() { cout<<"blue "; switch(state) { case 0: state++; if(m>=lion_life) {SN++;lion li(SN,lion_life);m-=lion_life;lion_num++; cout<<lion_num<<" lion in blue headquarter"<<endl; break;} case 1: state++; if(m>=dragon_life) {SN++;dragon dr(SN,dragon_life);m-=dragon_life;dragon_num++; cout<<dragon_num<<" dragon in blue headquarter"<<endl; break;} case 2: state++; if(m>=ninja_life) {SN++;ninja ni(SN,ninja_life);m-=ninja_life;ninja_num++; cout<<ninja_num<<" ninja in blue headquarter"<<endl; break;} case 3: state++; if(m>=iceman_life) {SN++;iceman ic(SN,iceman_life);m-=iceman_life;iceman_num++; cout<<iceman_num<<" iceman in blue headquarter"<<endl; break;} case 4: if(m>=wolf_life) {SN++;wolf wo(SN,wolf_life);m-=wolf_life;wolf_num++; cout<<wolf_num<<" wolf in blue headquarter"<<endl; state=0;break;} else { state=0; switch(state) { case 0: state++; if(m>=lion_life) {SN++;lion li(SN,lion_life);m-=lion_life;lion_num++; cout<<lion_num<<" lion in blue headquarter"<<endl; break;} case 1: state++; if(m>=dragon_life) {SN++;dragon dr(SN,dragon_life);m-=dragon_life;dragon_num++; cout<<dragon_num<<" dragon in blue headquarter"<<endl; break;} case 2: state++; if(m>=ninja_life) {SN++;ninja ni(SN,ninja_life);m-=ninja_life;ninja_num++; cout<<ninja_num<<" ninja in blue headquarter"<<endl; break;} case 3: state++; if(m>=iceman_life) {SN++;iceman ic(SN,iceman_life);m-=iceman_life;iceman_num++; cout<<iceman_num<<" iceman in blue headquarter"<<endl; break;} case 4: if(m>=wolf_life) {SN++;wolf wo(SN,wolf_life);m-=wolf_life;wolf_num++; cout<<wolf_num<<" wolf in blue headquarter"<<endl; state=0;break;} else {cout<<"headquarter stops making warriors"<<endl;state++;break;} default:break; } } default:break; } }};int main(){ int Case; int cnt; int M; int dragon_life,ninja_life,iceman_life,lion_life,wolf_life; int timer; cin>>Case; for(cnt=1;cnt<=Case;cnt++) { timer=0; cin>>M; cin>>dragon_life>>ninja_life>>iceman_life>>lion_life>>wolf_life; red re(M,dragon_life,ninja_life,iceman_life,lion_life,wolf_life); blue bl(M,dragon_life,ninja_life,iceman_life,lion_life,wolf_life); cout<<"Case:"<<cnt<<endl; while(!(re.getstate()==5 && bl.getstate()==5)) { cout<<setfill('0'); if(re.getstate()!=5) {cout<<setw(3)<<timer<<' ';re.born();} if(bl.getstate()!=5) {cout<<setw(3)<<timer<<' ';bl.born();} timer++; }} return 0;}
- 魔兽世界
- 魔兽世界
- 魔兽世界竞技场
- 魔兽世界角色
- 魔兽世界研究
- 魔兽世界编年史
- 魔兽世界会流行多久?
- 现在进行时--魔兽世界
- 魔兽世界服务器的研究
- 魔兽世界常用宏收集
- 魔兽世界的快捷键
- 魔兽世界锻造白皮书1.0
- 魔兽世界-战士的真谛
- 《魔兽世界》专用PC出现
- 《魔兽世界》法师的幽默
- 经典永恒《魔兽世界》周年纪念
- 《魔兽世界》任务系统体验
- [翻译]魔兽世界插件基础
- Red Hat Enterprise Linux 5——tftp、NFS、Samba服务器配置
- leetcode - Merge Two Sorted Lists
- ZOJ-1880
- POJ 2836 Rectangular Covering 状态压缩DP
- etnjsrtjnryj食肉菌认识他你就身体夜啊他和
- 魔兽世界
- HOOK其他进程API和全局HOOK-API
- Android bitmap中Matrix的几个操作
- 精益设计:“纸上谈兵”的说服力
- 基于cocos2dx的2D手游美术资源制作技术选型(1)(2)
- 数据结构中的几种排序
- [Network]Network Security
- 浅谈C#中的枚举
- 帽子的搭配