結果

問題 No.5017 Tool-assisted Shooting
ユーザー とろちゃとろちゃ
提出日時 2023-07-16 18:33:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 260 ms / 2,000 ms
コード長 3,613 bytes
コンパイル時間 951 ms
コンパイル使用メモリ 87,256 KB
実行使用メモリ 96,980 KB
スコア 1,276,135
平均クエリ数 607.03
最終ジャッジ日時 2023-07-16 18:34:14
合計ジャッジ時間 23,962 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 224 ms
93,348 KB
testcase_01 AC 233 ms
94,024 KB
testcase_02 AC 171 ms
93,332 KB
testcase_03 AC 132 ms
92,528 KB
testcase_04 AC 164 ms
92,536 KB
testcase_05 AC 232 ms
93,984 KB
testcase_06 AC 223 ms
93,892 KB
testcase_07 AC 195 ms
92,880 KB
testcase_08 AC 136 ms
92,120 KB
testcase_09 AC 126 ms
92,276 KB
testcase_10 AC 140 ms
92,820 KB
testcase_11 AC 176 ms
93,708 KB
testcase_12 AC 179 ms
93,056 KB
testcase_13 AC 255 ms
93,956 KB
testcase_14 AC 140 ms
92,420 KB
testcase_15 AC 234 ms
93,832 KB
testcase_16 AC 225 ms
93,844 KB
testcase_17 AC 208 ms
93,672 KB
testcase_18 AC 257 ms
93,800 KB
testcase_19 AC 174 ms
93,432 KB
testcase_20 AC 234 ms
93,772 KB
testcase_21 AC 226 ms
93,708 KB
testcase_22 AC 227 ms
93,432 KB
testcase_23 AC 224 ms
93,492 KB
testcase_24 AC 133 ms
92,804 KB
testcase_25 AC 178 ms
93,320 KB
testcase_26 AC 234 ms
93,784 KB
testcase_27 AC 186 ms
93,288 KB
testcase_28 AC 239 ms
93,924 KB
testcase_29 AC 184 ms
93,696 KB
testcase_30 AC 116 ms
92,232 KB
testcase_31 AC 135 ms
92,316 KB
testcase_32 AC 132 ms
92,288 KB
testcase_33 AC 195 ms
93,432 KB
testcase_34 AC 120 ms
92,676 KB
testcase_35 AC 157 ms
92,656 KB
testcase_36 AC 161 ms
93,072 KB
testcase_37 AC 231 ms
93,720 KB
testcase_38 AC 155 ms
93,448 KB
testcase_39 AC 227 ms
93,508 KB
testcase_40 AC 149 ms
93,628 KB
testcase_41 AC 249 ms
93,688 KB
testcase_42 AC 225 ms
93,588 KB
testcase_43 AC 146 ms
92,480 KB
testcase_44 AC 185 ms
93,040 KB
testcase_45 AC 149 ms
92,940 KB
testcase_46 AC 211 ms
93,592 KB
testcase_47 AC 228 ms
93,380 KB
testcase_48 AC 223 ms
93,768 KB
testcase_49 AC 233 ms
93,656 KB
testcase_50 AC 173 ms
93,204 KB
testcase_51 AC 151 ms
92,812 KB
testcase_52 AC 111 ms
91,980 KB
testcase_53 AC 202 ms
93,156 KB
testcase_54 AC 125 ms
92,252 KB
testcase_55 AC 229 ms
93,656 KB
testcase_56 AC 141 ms
92,780 KB
testcase_57 AC 184 ms
93,468 KB
testcase_58 AC 239 ms
93,324 KB
testcase_59 AC 137 ms
92,452 KB
testcase_60 AC 122 ms
92,592 KB
testcase_61 AC 239 ms
93,884 KB
testcase_62 AC 222 ms
94,076 KB
testcase_63 AC 231 ms
93,424 KB
testcase_64 AC 260 ms
93,428 KB
testcase_65 AC 258 ms
96,980 KB
testcase_66 AC 234 ms
94,000 KB
testcase_67 AC 215 ms
93,688 KB
testcase_68 AC 135 ms
92,732 KB
testcase_69 AC 233 ms
93,784 KB
testcase_70 AC 233 ms
93,560 KB
testcase_71 AC 124 ms
92,544 KB
testcase_72 AC 195 ms
93,820 KB
testcase_73 AC 121 ms
92,224 KB
testcase_74 AC 152 ms
92,532 KB
testcase_75 AC 205 ms
93,660 KB
testcase_76 AC 227 ms
93,612 KB
testcase_77 AC 136 ms
92,832 KB
testcase_78 AC 121 ms
92,156 KB
testcase_79 AC 236 ms
93,984 KB
testcase_80 AC 175 ms
93,004 KB
testcase_81 AC 223 ms
93,680 KB
testcase_82 AC 197 ms
93,832 KB
testcase_83 AC 218 ms
93,400 KB
testcase_84 AC 215 ms
93,608 KB
testcase_85 AC 138 ms
92,528 KB
testcase_86 AC 167 ms
93,392 KB
testcase_87 AC 140 ms
92,436 KB
testcase_88 AC 219 ms
93,560 KB
testcase_89 AC 139 ms
92,244 KB
testcase_90 AC 169 ms
93,028 KB
testcase_91 AC 138 ms
92,372 KB
testcase_92 AC 226 ms
93,976 KB
testcase_93 AC 152 ms
93,188 KB
testcase_94 AC 229 ms
93,372 KB
testcase_95 AC 227 ms
93,576 KB
testcase_96 AC 146 ms
92,652 KB
testcase_97 AC 221 ms
93,428 KB
testcase_98 AC 140 ms
92,688 KB
testcase_99 AC 210 ms
93,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
# from collections import *
# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import *  # PyPyだと遅い
# from string import ascii_lowercase, ascii_uppercase
# import numpy as np
import sys
import os

# sys.setrecursionlimit(10**6)  # PyPyだと遅い
INF = 10**18
MOD = 998244353
# MOD = 10**9 + 7
isTest = os.path.exists("input.txt")
File = open("input.txt", "r") if isTest else sys.stdin


def input():
    return File.readline()[:-1]


# ///////////////////////////////////////////////////////////////////////////

if isTest:
    _P = list(map(int, input().split()))
    outFile = open("output.txt", "w")


# 盤面を動かす関数
def moveGrid(grid):
    for i in range(1, 60):
        for j in range(25):
            grid[i - 1][j] = grid[i][j]
            if i == 59:
                grid[i][j] = (0, 0, 0)


# 敵までの距離を求める関数
def distance(grid, now):
    if not 0 <= now <= 24:
        return -1
    for i in range(60):
        if grid[i][now][0]:
            return i
    return -1


# 列で得られるポイントを求める関数
def totalPoint(grid, idx):
    if not 0 <= idx <= 24:
        return -1

    total = 0
    dist = 0
    for i in range(60):
        if grid[i][idx][0]:
            if grid[i][idx][0] > (i - dist) * (total_power // 100 + 1):
                break
            dist = i
            total += grid[i][idx][2]
    else:
        return total
    if i == 0:
        return -100
    else:
        return total


P = [0] * 25
you = 12
move = ["S", "R", "L"]
score = 0
turn = 0
total_power = 0
grid = [[(0, 0, 0) for _ in range(25)] for _ in range(60)]
one = 1
while True:
    n = int(input())
    if n == -1:
        break
    enemy = [list(map(int, input().split())) for _ in range(n)]
    moveGrid(grid)
    for h, p, x in enemy:
        P[x] += 1
        grid[59][x] = (h, p, h)

    ans = 0
    center = totalPoint(grid, you)
    left = totalPoint(grid, you - 1)
    right = totalPoint(grid, you + 1)
    if sum([i for i in [center, left, right] if i != -1]) == 0:
        if you == 0 or you == 24:
            one *= -1
        ans = one
        if one == 1:
            dist = distance(grid, you + 1)
        else:
            dist = distance(grid, you - 1)
    elif center == 0:
        if left == -100 and right == -100:
            ans = 0
            dist = distance(grid, you)
        elif left > right:
            ans = -1
            dist = distance(grid, you - 1)
        else:
            ans = 1
            dist = distance(grid, you + 1)
    else:
        if center >= left and center >= right:
            ans = 0
            dist = distance(grid, you)
        elif left >= center and left >= right:
            ans = -1
            dist = distance(grid, you - 1)
        elif right >= center and right >= left:
            ans = 1
            dist = distance(grid, you + 1)

    you = you + ans

    if dist != -1:
        grid[dist][you] = (
            grid[dist][you][0] - (total_power // 100 + 1),
            grid[dist][you][1],
            grid[dist][you][2],
        )
        if grid[dist][you][0] <= 0:
            score += grid[dist][you][2]
            total_power += grid[dist][you][1]
            grid[dist][you] = (0, 0, 0)

    if isTest:
        outFile.write(move[ans] + "\n")
        outFile.write("#" + " ".join([str(i) for i in P]) + "\n")
    else:
        print(move[ans], flush=True)

    turn += 1
    if turn == 1000:
        break

if isTest:
    outFile.close()
0