【计算机本科补全计划】CCF计算机职业资格认证 2016-09-03(炉石传说)详解

#include<iostream>
#include<string>
#include<vector>
using namespace std;

class Role
{
public:
    int place;
    int HP;
    int MP;
    // bool player;
};



void Summon(vector<Role> &chess,int position,int MP,int HP)
{
    for(auto &x:chess)
    {
        if (x.place>=position && x.place<=7)
            x.place+=1;
    }
    Role ThisSubmmom;
    ThisSubmmom.place=position;
    ThisSubmmom.HP=HP;
    ThisSubmmom.MP=MP;
    chess.push_back(ThisSubmmom);
}

void Attack(vector<Role> &chess1,vector<Role> &chess2,int attacker,int defender)
{
    int m=0;
    auto p1=chess1.begin(), p2=chess2.begin();
    for(auto x=chess1.begin();x!= chess1.end();++x)
    {
        if((*x).place==attacker)
        {
            m=(*x).MP;
            (*x).HP-=(*x).MP;
            p1=x;
        }
    }
    for(auto x=chess2.begin();x!=chess2.end();++x)
    {
        if((*x).place==defender)
        {
            (*x).HP-=m;
            p2=x;
        }
    }
    if((*p1).HP<=0)
    {
        for(auto &x:chess1)
        {
            if (x.place>(*p1).place)
                x.place-=1;
        }
        chess1.erase(p1);
    }
    if((*p2).HP<=0)
    {
        for(auto &x:chess2)

        {
            if (x.place>(*p2).place)
                x.place-=1;
        }
        chess2.erase(p2);
    }
}


int main()
{
    int round;
    Role hero;
    hero.place=0;
    hero.HP=30;
    hero.MP=0;
    vector<Role> Chess1;
    vector<Role> Chess2;
    Chess1.push_back(hero);
    Chess2.push_back(hero);
    cin>>round;
    string action;
    bool Xianshou=true;
    while(round--)
    {
        cin>>action;
        int ac=0;
        if(action=="summon")
            ac=1;
        else if(action=="attack")
            ac=2;
        else
            ac=3;
        switch(ac)
        {
            case 1:
            {
                int a,b,c;
                cin>>a>>b>>c;
                if (Xianshou)
                    Summon(Chess1,a,b,c);
                else
                    Summon(Chess2,a,b,c);
                break;
            }
            case 2:
            {
                int a,b;
                cin>>a>>b;
                if(Xianshou)
                    Attack(Chess1,Chess2,a,b);
                else
                    Attack(Chess2,Chess1,a,b);
                break;
            }
            case 3:
                Xianshou=!Xianshou;
                break;
            default:
                cout<<"you idot~"<<endl;
        }
    }
    int result=0;
    if((*Chess1.begin()).HP==0)
        result=-1;
    else if((*Chess2.begin()).HP==0)
        result=1;
    else
        result=0;
    cout<<result<<endl;
    cout<<(*Chess1.begin()).HP<<endl;
    cout<<Chess1.size()-1<<" ";
    for(auto x=Chess1.begin()+1;x!=Chess1.end();++x)
        cout<<(*x).HP<<" ";
    cout<<endl;
     cout<<(*Chess1.begin()).HP<<endl;
    cout<<Chess2.size()-1<<" ";
    for(auto x=Chess2.begin()+1;x!=Chess2.end();++x)
        cout<<(*x).HP<<" ";
    return 0;
}

Last login: Tue Nov 28 11:43:23 on ttys001
HustWolf:~ zhangzhaobo$ /Users/zhangzhaobo/program/C++/CCF_2016_09_3 ; exit;
8
summon 1 3 6
summon 2 4 2
end
summon 1 4 5
summon 1 2 1
attack 1 2
end
attack 1 1
0
30
1 3 
30
1 2 logout
Saving session...
...copying shared history...
...saving history...truncating history files...
...completed.

[进程已完成]

void Attack(vector<Role> &chess1,vector<Role> &chess2,int attacker,int defender)
//每次攻击，都要有一个攻击方，一个被攻击方，以及一个攻击随从和一个防御随从，所以传进来四个参数，因为要对参数进行改变，所以采用引用~
{
    int m=0; // 此处用于记录攻击者的攻击力，用来对防御方进行掉血
    auto p1=chess1.begin(), p2=chess2.begin();  //记录攻击随从和防御随从的位置，在一次操作后对其进行检验，看是否还存活
    for(auto x=chess1.begin();x!= chess1.end();++x)
    {
// find the position of the attacker in the chess1
        if((*x).place==attacker)
        {
            m=(*x).MP;  //record the power of attacker
            (*x).HP-=(*x).MP;  
//杀敌一千，自损一千   我一开始直接就习惯性的把MP写成了HP 惨淡，玩命~
            p1=x;   //record the position of attacker
        }
    }
    for(auto x=chess2.begin();x!=chess2.end();++x)
    {
// find the position of defender in the chess2 
        if((*x).place==defender)
        {
            (*x).HP-=m;  //被杀一千
            p2=x; //record the position of the defender
        }
    }
    if((*p1).HP<=0)
    {
// look at the attacker and his life
        for(auto &x:chess1)
        {
            if (x.place>(*p1).place)
                x.place-=1;
        }
        chess1.erase(p1);  // if he dies,erase him.
    }
    if((*p2).HP<=0)
    {
        for(auto &x:chess2)

        {
            if (x.place>(*p2).place)
                x.place-=1;
        }
        chess2.erase(p2);
    }
}

if((*p1).HP<=0)
    {
        for(auto &x:chess1)
        {
            if (x.place>(*p1).place)
                x.place-=1;
        }
        chess1.erase(p1);
    }
    if((*p2).HP<=0)
    {
        for(auto &x:chess2)

        {
            if (x.place>(*p2).place)//一开始这里是写的p1，所以我就奇怪每次都会报错？？？因为p2根本不在x的序列中！！所以会有重合的position，然后就GG
                x.place-=1;
        }
        chess2.erase(p2);
    }

cin>>action;
switch(ac)  
{
    case "summon":  // 好像是case后面只跟int
    {
        int a,b,c;
        cin>>a>>b>>c;
        if (Xianshou)
            Summon(Chess1,a,b,c);
        else
            Summon(Chess2,a,b,c);
        break;
    }
    case "attack":
    {
        int a,b;
        cin>>a>>b;
        if(Xianshou)
            Attack(Chess1,Chess2,a,b);
        else
            Attack(Chess2,Chess1,a,b);
        break;
    }
    case "end":
        Xianshou=!Xianshou;
        break;
    default:
        cout<<"you idot~"<<endl;
}

cin>>action;
        map<string,int> act;
        act.insert(pair<string,int>("summon",1));
        act.insert(pair<string,int>("attack",2));
        act.insert(pair<string,int>("end",3));
        switch(act[action])

return 0;