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
| #include<iostream>
#include <vector>
#include <queue>
using namespace std;
class atom {
public:
int energy;
int way;
int x;
int y;
bool dead;
atom(int _x, int _y ,int e, int w, bool d) : x(_x), y(_y), energy(e), way(w) , dead(d){
}
};
int main(int argc, char** argv)
{
int test_case;
int T;
int N, x, y, energy, way,answer;
int dx[4] = { 0,0,-1,1 };
int dy[4] = { -1,1,0,0 };
cin>>T;
for(test_case = 1; test_case <= T; ++test_case)
{
cin >> N;
vector<atom> atoms;
vector<int> colision;
vector<vector<int>> MAP(2001, vector<int>(2001, 0));
queue<pair<int, int>> boom;
atoms.push_back(atom(0, 0, 0, 0, false));
answer = 0;
int value;
for (int j = 1; j <= N; j++) {
cin >> x >> y >> way >> energy;
x += 1000; y = 1000 - y;
MAP[y][x] = j;
atoms.push_back(atom(x, y, energy, way, false));
}
for (int k = 0; k <= 2001; k++) {
bool flag=true;
for (int j = 1; j <= N; j++) {
if (atoms[j].dead)
continue;
flag = false;
int _x = atoms[j].x + dx[atoms[j].way];
int _y = atoms[j].y + dy[atoms[j].way];
if (0 <= _x && _x <= 2000 && 0 <= _y && _y <= 2000) {
if (MAP[_y][_x] !=0)
if (atoms[j].way + atoms[MAP[_y][_x]].way == 1 || atoms[j].way + atoms[MAP[_y][_x]].way == 5) {
atoms[j].dead = true;
atoms[MAP[_y][_x]].dead = true;
colision.push_back(j);
colision.push_back(MAP[_y][_x]);
MAP[_y][_x] = 0;
MAP[atoms[j].y][atoms[j].x] = 0;
}
}
}
for(int j=1;j<=N;j++){
if (atoms[j].dead)
continue;
if (MAP[atoms[j].y][atoms[j].x] == j)
MAP[atoms[j].y][atoms[j].x] = 0;
atoms[j].x = atoms[j].x + dx[atoms[j].way];
atoms[j].y = atoms[j].y + dy[atoms[j].way];
if (0 > atoms[j].x || atoms[j].x > 2000 || 0 > atoms[j].y || atoms[j].y > 2000) {
atoms[j].dead = true;
}
if (atoms[j].dead)
continue;
value = MAP[atoms[j].y][atoms[j].x];
if (value == 1234) {
colision.push_back(j);
atoms[j].dead = true;
}
else if (value == 0 || value > j) {
MAP[atoms[j].y][atoms[j].x] = j;
}
else {
if (value < j) {
colision.push_back(MAP[atoms[j].y][atoms[j].x]);
colision.push_back(j);
atoms[MAP[atoms[j].y][atoms[j].x]].dead = true;
atoms[j].dead = true;
MAP[atoms[j].y][atoms[j].x] = 1234;
boom.push(make_pair(atoms[j].y, atoms[j].x));
}
}
}
if (flag)
break;
while (!boom.empty()) {
MAP[boom.front().first][boom.front().second] = 0;
boom.pop();
}
}
for (int j = 0; j < colision.size(); j++)
answer += atoms[colision[j]].energy;
cout << "#" << test_case << " " << answer << endl;
}
return 0;
}
|
