1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
#include<bits/stdc++.h>
using namespace std;
#define _ =read()
inline int read(){
int r = 0 , w = 1;
char ch = getchar();
while(ch > '9' || ch < '0') {if(ch == '-') w = -1; ch = getchar();}
while(ch >='0' && ch <='9') {r = r * 10 + ch -'0'; ch = getchar();}
return r * w;
}
namespace FileIO{
string InFile;
string OutFile;
void File(string s){
InFile = s + ".in";
OutFile = s + ".out";
freopen(InFile.data() , "r" , stdin);
freopen(OutFile.data() , "w" , stdout);
}
}
typedef set<int>::iterator Type;
const int Maxn = 20;
const int dirx[] = {0 , 1 , 0 , -1};
const int diry[] = {1 , 0 , -1 , 0};
struct Point{
int x , y;
friend bool operator == (Point a , Point b){
return a.x == b.x && a.y == b.y;
}
};
Point St;
Point Ed;
Point ar[Maxn * Maxn];
struct fort{
Point pos;
int dmg;
int dis;
int type;
int loc;
};
fort T[Maxn];
fort t[Maxn];
struct enemy{
int bld;
int spd;
int rk;
int mark;
int bel;
friend bool operator < (enemy a , enemy b){
if(a.bld != b.bld) return a.bld < b.bld;
else return a.rk < b.rk;
}
};
enemy E[Maxn * Maxn];
struct comp{
bool operator ()(int a , int b){
return E[a] < E[b];
}
};
int n;
int m;
int tnum;
int head;
int top;
int q;
int Len;
int tot = 10;
int Round;
int dam[Maxn * Maxn];
int ans[Maxn * Maxn];
int tmp[Maxn];
char str[Maxn];
bool Mp[Maxn][Maxn];
set<int , comp> s[Maxn * Maxn];
vector<int> loc[Maxn * Maxn];
bool in(Point x){
return x.x <= n && x.y <= m && x.x >= 1 && x.y >= 1;
}
inline int dis(Point x , Point y){
return (x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y);
}
void dfs(Point x , int p , Point last){
if(x == Ed){
Len = p - 1;
return;
}
Point y;
for(int i = 0 ; i < 4 ; i++){
y.x = x.x + dirx[i];
y.y = x.y + diry[i];
if(y == last) continue;
if(in(y) && Mp[y.x][y.y]){
ar[++p] = y;
dfs(y , p , x);
break;
}
}
}
void Init() {
n _ , m _;
for(int i = 1 ; i <= n ; i++){
scanf("%s" , str + 1);
for(int j = 1 ; j <= m ; j++){
if(str[j] == 'S') St.x = i , St.y = j , Mp[i][j] = 1;
else if (str[j] == 'T') Ed.x = i , Ed.y = j , Mp[i][j] = 1;
else if (str[j] == '0') Mp[i][j] = 1;
else if(str[j] > '0' && str[j] <= '9') tmp[++top] = str[j] - '0' , t[top].pos.x = i , t[top].pos.y = j;
}
}
tnum _;
for(int i = 1 ; i <= tnum ; i++) T[i].dmg _ , T[i].dis _ , T[i].type _ , T[i].dis *= T[i].dis , T[i].loc = 0;
q _;
for(int i = 1 ; i <= q ; i++) E[i].bld _ , E[i].spd _ , E[i].rk = i , E[i].bel = 0 , E[i].mark = 0;
ar[1] = St;
dfs(St , 1 , Point{0 , 0});
for(int i = 1 ; i <= top ; i++){
t[i].dmg = T[tmp[i]].dmg;
t[i].dis = T[tmp[i]].dis;
t[i].type = T[tmp[i]].type;
t[i].loc = T[tmp[i]].loc;
}
}
void summon(){
if(head == q) return;
s[1].insert(++head);
E[head].bel = 1;
}
void locate(){
for(int i = 1 ; i <= top ; i++){
if(t[i].loc && dis(t[i].pos , ar[E[t[i].loc].bel]) <= t[i].dis) continue;
t[i].loc = 0;
for(int j = Len ; j ; j--){
if(!s[j].empty() && dis(ar[j] , t[i].pos) <= t[i].dis){
t[i].loc = *s[j].begin();
break;
}
}
}
}
void calc(Point a , Point b , int &A , int &B , int &C){
int x1 = a.x , x2 = b.x , y1 = a.y , y2 = b.y;
A = y1 - y2 , B = x2 - x1 , C = -(A * x1 + B * y1);
}
bool ifyoucan(Point p , int A , int B , int C){
int x = p.x , y = p.y;
return (A * x + B * y + C) * (A * x + B * y + C) <= (A * A + B * B);
}
void attack(){
memset(dam , 0 , sizeof dam);
for(int i = 1 ; i <= top ; i++){
int x = t[i].loc;
if(x == 0) continue;
if(t[i].type == 0) dam[x] += t[i].dmg;
if(t[i].type == 1) {
int j = E[x].bel;
for(Type it = s[j].begin() ; it != s[j].end() ; it++) dam[*it] += t[i].dmg;
if(j > 1){
for(Type it = s[j - 1].begin() ; it != s[j - 1].end() ; it++) dam[*it] += t[i].dmg;
}
if(j < Len){
for(Type it = s[j + 1].begin() ; it != s[j + 1].end() ; it++) dam[*it] += t[i].dmg;
}
}
if(t[i].type == 2){
int a , b , c;
calc(t[i].pos , ar[E[x].bel] , a , b , c);
for(int j = 1 ; j <= Len ; j++){
if(ifyoucan(ar[j] , a , b , c)){
for(Type it = s[j].begin() ; it != s[j].end() ; it++) dam[*it] += t[i].dmg;
}
}
}
if(t[i].type == 3) dam[x] += t[i].dmg , E[x].mark = 1;
}
}
void check_damage(){
for(int i = 1 ; i <= head ; i++){
if(E[i].bel == 0) continue;
if(E[i].bld <= dam[i]) s[E[i].bel].erase(i) , E[i].bel = 0 , ans[i] = Round;
else E[i].bld -= dam[i];
}
for(int i = 1 ; i <= top ; i++){
if(!E[t[i].loc].bel) t[i].loc = 0;
}
}
void move(){
for(int i = 1 ; i <= head ; i++){
if(E[i].bel == 0) continue;
if(E[i].spd > E[i].mark){
s[E[i].bel].erase(i);
E[i].bel += (E[i].spd - E[i].mark);
if (E[i].bel > Len) {
E[i].bel = 0;
tot--;
ans[i] = -Round;
continue;
}
s[E[i].bel].insert(i);
}
}
}
bool nooneyesman(){
bool flag = 1;
for(int i = 1 ; i <= head && flag ; i++){
if(E[i].bel) flag = 0;
}
return flag;
}
void Work() {
bool g = 1 , gg = 1;
while (tot) {
Round++;
summon() , locate() , attack();
check_damage() , move();
if(head == q && nooneyesman()) break;
}
}
void InTheEnd(){
cout << Round << " " << tot << "\n";
if(tot == 0) cout << "Xiao B is SB!\n";
else cout << "Victory!\n";
for(int i = 1 ; i <= q ; i++){
if(ans[i] > 0) cout << "Died in round" << " " << ans[i] << "\n";
else if(ans[i] < 0) cout << "Arrived your base in round" << " " << -ans[i] << "\n";
else cout << "The game has been over!\n";
}
}
signed main() {
Init();
Work();
InTheEnd();
return 0;
}
|