简单的模拟题
#include <bits/stdc++.h>
using namespace std;
int n;
struct fllower {
int id;
int health;
int attack;
};
struct player{
int cnt = 0;
int id = 1;
int health = 30;
int attack = 0;
fllower f[10];
};
int winner = -1;
int mod = 0;
player players[2];
void solveSummon() {
int position, attack, health;
cin >> position >> attack >> health;
players[mod].cnt++;
for (int i = 6; i >= position; i--) {
players[mod].f[i + 1] = players[mod].f[i];
players[mod].f[i + 1].id = i + 1;
}
players[mod].f[position].id = position;
players[mod].f[position].health = health;
players[mod].f[position].attack = attack;
}
void solveAttack() {
int attacker, defender;
cin >> attacker >> defender;
int oa;
int ta = players[mod].f[attacker].attack;
if (defender == 0) {
oa = players[!mod].attack;
players[!mod].health -= ta;
if (players[!mod].health <= 0) {
winner = mod;
}
} else {
oa = players[!mod].f[defender].attack;
players[!mod].f[defender].health -= ta;
if (players[!mod].f[defender].health <= 0) {
players[!mod].cnt--;
for (int i = defender; i <= 6; i++) {
players[!mod].f[i] = players[!mod].f[i + 1];
players[!mod].f[i].id = i;
}
}
}
players[mod].f[attacker].health -= oa;
if (players[mod].f[attacker].health <= 0) {
players[mod].cnt--;
for (int i = attacker; i <= 6; i++) {
players[mod].f[i] = players[mod].f[i + 1];
players[mod].f[i].id = i;
}
}
}
void readPlayer() {
string action;
cin >> action;
if (action == "summon") {
solveSummon();
} else if (action == "attack") {
solveAttack();
} else {
mod = !mod;
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
readPlayer();
}
if (winner == -1) {
cout << 0 << '\n';
} else if (winner == 0) {
cout << 1 << '\n';
} else {
cout << -1 << '\n';
}
cout << players[0].health << '\n';
cout << players[0].cnt << ' ';
for (int i = 1; i <= players[0].cnt; i++) {
cout << players[0].f[i].health << ' ';
}
cout << '\n';
cout << players[1].health << '\n';
cout << players[1].cnt << ' ';
for (int i = 1; i <= players[1].cnt; i++) {
cout << players[1].f[i].health << ' ';
}
}