結果

問題 No.5017 Tool-assisted Shooting
ユーザー 無職
提出日時 2023-07-16 18:37:27
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 2,259 bytes
コンパイル時間 521 ms
コンパイル使用メモリ 87,200 KB
実行使用メモリ 96,688 KB
スコア 89,771
平均クエリ数 1.00
最終ジャッジ日時 2023-07-16 18:37:53
合計ジャッジ時間 25,003 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other RE * 100
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

is_test = False
def main():
#
player_pos = 12
#
player_level = 1
#
destroyed_enemy_power = 0
#
enemies = []
for tern in range(1000):
#
n = int(input())
if n == -1:
#
break
new_enemies = []
for _ in range(n):
h, p, x = map(int, input().split())
new_enemies.append([h, p, x])
# 1
#if len(enemies) > 0:
enemies = [[h, p, x - 1] for h, p, x in enemies if x - 1 >= 0]
#
enemies.extend(new_enemies)
#
enemies_in_same_column = [enemy for enemy in enemies if enemy[2] == player_pos]
if enemies_in_same_column:
closest_enemy = min(enemies_in_same_column, key=lambda enemy: enemy[1])
#
closest_enemy[0] -= player_level
if closest_enemy[0] <= 0:
#
enemies.remove(closest_enemy)
destroyed_enemy_power += closest_enemy[1]
player_level = 1 + destroyed_enemy_power // 100
#
if not enemies_in_same_column:
if enemies:
target_pos = max(enemies, key=lambda enemy: enemy[1])[2]
if target_pos < player_pos:
player_pos = (player_pos - 1) % 25
print('L')
elif target_pos > player_pos:
player_pos = (player_pos + 1) % 25
print('R')
else:
print('S')
else:
print('S')
else:
print('S')
sys.stdout.flush()
if is_test:
import sys
with open('./input.txt', 'r') as f:
sys.stdin = f
with open('./output.txt', 'w') as f2:
sys.stdout = f2
input()
main()
else:
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0