#885265 (C++17(gcc12)) No.5017 Tool-assisted Shooting

• 問題: No.5017 Tool-assisted Shooting
• ユーザー: platinum
• 提出日時: 2023-06-28 23:55:09
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 102 ms / 2,000 ms
• コード長: 5,433 bytes
• コンパイル時間: 2,485 ms
• コンパイル使用メモリ: 210,164 KB
• 実行使用メモリ: 24,384 KB
• スコア: 2,760,634
• 平均クエリ数: 3968.04
• 最終ジャッジ日時: 2023-07-16 13:30:34
• 合計ジャッジ時間: 15,932 ms
• ジャッジサーバーID （参考情報）: judge15 / judge13

ファイルパターン	結果
other	AC * 100

ソースコード

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
#include <bits/stdc++.h>
using namespace std;
constexpr int width = 25;  // フィールドの幅
constexpr int height = 60; // フィールドの高さ
constexpr int max_turn = 1000; // ゲームの最大ターン数
constexpr int level_up = 100; // レベルアップに必要なパワー値
constexpr int INF = (int)1e9;
// 敵機の情報
struct Enemy {
    int init_hp;
    int h, p;
    int x, y;
    Enemy(int h, int p, int x) : h(h), p(p), x(x) {
        init_hp = h;
        y = height - 1;
    }
};
// 自機の情報
struct Player {
    int x, y;
    int score;
    int power, level;
    Player(int x, int y) : x(x), y(y) {
        score = 0;
        power = 0;
        level = 1;
    }
    void destroy_enemy(Enemy* e) {
        score += e->init_hp;
        power += e->p;
        level = 1 + power / level_up;
    }
    bool try_move(vector<vector<Enemy*>>& field ,char c) {
        if(c == 'L') {
            int nx = (x - 1 + width) % width;
            if(field[y][nx]) return false;
            else if(field[y+1][nx]) return false;
            else return true;
        }
        else if(c == 'R') {
            int nx = (x + 1) % width;
            if(field[y][nx]) return false;
            else if(field[y+1][nx]) return false;
            else return true;
        }
        else if(c == 'S') {
            if(field[y+1][x]) return false;
            return true;
        }
        else return false;
    }
    void apply_move(char c) {
        std::cout << c << std::endl;
        std::cout << "# " << c << std::endl;
        if(c == 'L') {
            x = (x - 1 + width) % width;
        }
        else if(c == 'R') {
            x = (x + 1) % width;
        }
    }
};
int main(){
    Player player(12, 0);
    vector<vector<Enemy>> enemies(max_turn + 1);
    vector field = vector(height, vector<Enemy*>(width, nullptr));
    for(int T = 1; T <= max_turn; T++) {
        // 敵機の移動
        for(int y = 0; y < height; y++) {
            for(int x = 0; x < width; x++) {
                if(!field[y][x]) continue;
                field[y][x]->y -= 1;
                if(y == 0) {
                    field[y][x] = nullptr;
                }
                else {
                    field[y-1][x] = field[y][x];
                    field[y][x] = nullptr;
                    if(y - 1 == player.y && x == player.x) {
                        std::cerr << "turn = " << T << endl;
                        std::cerr << "score = " << player.score << endl;
                        return 0;                       
                    }
                }
            }
        }
        // 入力の受け取り
        int n;
        cin >> n;
        if(n == -1) return 0;
        for(int i = 0; i < n; i++) {
            int h, p, x;
            cin >> h >> p >> x;
            enemies[T].emplace_back(h, p, x);
        }
        for(auto& enemy : enemies[T]) {
            field[height-1][enemy.x] = &enemy;
        }
        // 自機の移動
        // 敵機を倒せない列には移動しない
        vector<int> invalid_line(width);
        for(int t = 1; t <= T; t++) {
            for(auto& enemy : enemies[t]) {
                if(enemy.y < 0 || enemy.h <= 0) continue;
                int dx1 = abs(enemy.x - player.x);
                int dx2 = abs(enemy.x - (player.x - width));
                int dx = max(1, min(dx1, dx2));
                int dy = enemy.y;
                int des = dx - 1 + (enemy.h + player.level - 1) / player.level;
                if(dy < des) {
                    invalid_line[enemy.x] = 1;
                }
            }
        }
        // 一番早く倒せる敵を探す
        Enemy* near_enemy = nullptr;
        int min_dist = INF;
        for(int t = 1; t <= T; t++) {
            for(auto& enemy : enemies[t]) {
                if(enemy.y < 0 || enemy.h <= 0) continue;
                if(invalid_line[enemy.x]) continue;
                int dx1 = abs(enemy.x - player.x);
                int dx2 = abs(enemy.x - (player.x - width));
                int dx = min(dx1, dx2);
                int dy = enemy.y;
                int des = dx - 1 + enemy.h / player.level;
                if(des < min_dist) {
                    min_dist = des;
                    near_enemy = &enemy;
                }
            }
        }
        // 倒せる敵がいない場合
        if(!near_enemy) {
            if(player.try_move(field, 'S')) {
                player.apply_move('S');
            }
            else if(player.try_move(field, 'L')) {
                player.apply_move('S');
            }
            else if(player.try_move(field, 'R')) {
                player.apply_move('R');
            }
            else player.apply_move('S');
        }
        // 同列に倒せる敵がいるならとどまる
        else if(near_enemy->x == player.x) {
            player.apply_move('S');
        }
        // 敵が左にいる場合
        else if(near_enemy->x < player.x) {
            int ex = near_enemy->x, px = player.x;
            int left = px - ex, right = ex - (px - width);
            if(left < right) {
                if(player.try_move(field, 'L')) {
                    player.apply_move('L');
                }
                else if(player.try_move(field, 'S')) {
                    player.apply_move('S');
                }
                else player.apply_move('R');
            }
            else {
                if(player.try_move(field, 'R')) {
                    player.apply_move('R');
                }
                else if(player.try_move(field, 'S')) {
                    player.apply_move('S');
                }
                else player.apply_move('L');
            }
        }
        // 敵が右にいる場合
        else {
            int ex = near_enemy->x, px = player.x;
            int left = px + width - ex, right = ex - px;
            if(left < right) {
                if(player.try_move(field, 'L')) {
                    player.apply_move('L');
                }
                else if(player.try_move(field, 'S')) {
                    player.apply_move('S');
                }
                else player.apply_move('R');
            }
            else {
                if(player.try_move(field, 'R')) {
                    player.apply_move('R');
                }
                else if(player.try_move(field, 'S')) {
                    player.apply_move('S');
                }
                else player.apply_move('L');
            }           
        }
        if(near_enemy) {
            cout << "# " << near_enemy->x << " " << near_enemy->y << endl;
            cout << "# hp = " << near_enemy->h << endl;
        }
        // 自機の攻撃
        int px = player.x, py = player.y + 1;
        while(py < height) {
            if(field[py][px]) {
                field[py][px]->h -= player.level;
                if(field[py][px]->h <= 0) {
                    player.destroy_enemy(field[py][px]);
                    field[py][px] = nullptr;
                }
                break;
            }
            py++;
        }
    }
    std::cerr << "turn = " << max_turn + 1 << endl;
    std::cerr << "score = " << player.score << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX