結果

問題 No.5017 Tool-assisted Shooting
ユーザー とろちゃとろちゃ
提出日時 2023-07-16 18:39:43
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 247 ms / 2,000 ms
コード長 3,372 bytes
コンパイル時間 427 ms
コンパイル使用メモリ 87,124 KB
実行使用メモリ 95,832 KB
スコア 1,312,854
平均クエリ数 638.12
最終ジャッジ日時 2023-07-16 18:40:36
合計ジャッジ時間 23,810 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 127 ms
92,524 KB
testcase_01 AC 145 ms
92,620 KB
testcase_02 AC 215 ms
93,752 KB
testcase_03 AC 217 ms
93,868 KB
testcase_04 AC 169 ms
93,260 KB
testcase_05 AC 221 ms
94,008 KB
testcase_06 AC 213 ms
93,860 KB
testcase_07 AC 219 ms
93,964 KB
testcase_08 AC 112 ms
92,440 KB
testcase_09 AC 122 ms
92,988 KB
testcase_10 AC 137 ms
92,500 KB
testcase_11 AC 219 ms
93,696 KB
testcase_12 AC 152 ms
92,968 KB
testcase_13 AC 204 ms
93,972 KB
testcase_14 AC 214 ms
93,828 KB
testcase_15 AC 213 ms
94,008 KB
testcase_16 AC 219 ms
93,400 KB
testcase_17 AC 239 ms
93,760 KB
testcase_18 AC 216 ms
93,412 KB
testcase_19 AC 135 ms
92,484 KB
testcase_20 AC 216 ms
93,448 KB
testcase_21 AC 174 ms
93,016 KB
testcase_22 AC 214 ms
93,172 KB
testcase_23 AC 205 ms
93,576 KB
testcase_24 AC 117 ms
92,208 KB
testcase_25 AC 211 ms
94,072 KB
testcase_26 AC 137 ms
92,784 KB
testcase_27 AC 220 ms
93,660 KB
testcase_28 AC 244 ms
93,812 KB
testcase_29 AC 155 ms
93,056 KB
testcase_30 AC 215 ms
93,480 KB
testcase_31 AC 148 ms
93,440 KB
testcase_32 AC 223 ms
94,244 KB
testcase_33 AC 129 ms
93,000 KB
testcase_34 AC 168 ms
92,872 KB
testcase_35 AC 132 ms
92,656 KB
testcase_36 AC 155 ms
93,372 KB
testcase_37 AC 213 ms
93,648 KB
testcase_38 AC 215 ms
93,544 KB
testcase_39 AC 220 ms
93,488 KB
testcase_40 AC 225 ms
93,496 KB
testcase_41 AC 116 ms
92,700 KB
testcase_42 AC 144 ms
92,820 KB
testcase_43 AC 227 ms
93,784 KB
testcase_44 AC 222 ms
93,436 KB
testcase_45 AC 172 ms
93,032 KB
testcase_46 AC 124 ms
92,300 KB
testcase_47 AC 119 ms
92,660 KB
testcase_48 AC 221 ms
94,432 KB
testcase_49 AC 141 ms
92,640 KB
testcase_50 AC 124 ms
92,480 KB
testcase_51 AC 129 ms
92,292 KB
testcase_52 AC 137 ms
92,420 KB
testcase_53 AC 218 ms
93,384 KB
testcase_54 AC 221 ms
93,772 KB
testcase_55 AC 149 ms
93,040 KB
testcase_56 AC 214 ms
93,460 KB
testcase_57 AC 200 ms
93,608 KB
testcase_58 AC 214 ms
93,200 KB
testcase_59 AC 223 ms
93,360 KB
testcase_60 AC 220 ms
93,276 KB
testcase_61 AC 133 ms
92,484 KB
testcase_62 AC 222 ms
93,620 KB
testcase_63 AC 220 ms
93,400 KB
testcase_64 AC 215 ms
93,852 KB
testcase_65 AC 140 ms
92,612 KB
testcase_66 AC 133 ms
92,432 KB
testcase_67 AC 122 ms
92,732 KB
testcase_68 AC 132 ms
92,324 KB
testcase_69 AC 221 ms
94,032 KB
testcase_70 AC 217 ms
93,580 KB
testcase_71 AC 121 ms
92,052 KB
testcase_72 AC 134 ms
92,876 KB
testcase_73 AC 175 ms
93,560 KB
testcase_74 AC 224 ms
93,812 KB
testcase_75 AC 171 ms
93,204 KB
testcase_76 AC 219 ms
94,100 KB
testcase_77 AC 247 ms
95,832 KB
testcase_78 AC 218 ms
93,560 KB
testcase_79 AC 223 ms
94,152 KB
testcase_80 AC 220 ms
93,912 KB
testcase_81 AC 222 ms
93,856 KB
testcase_82 AC 136 ms
92,776 KB
testcase_83 AC 222 ms
93,484 KB
testcase_84 AC 123 ms
92,688 KB
testcase_85 AC 246 ms
93,672 KB
testcase_86 AC 219 ms
93,584 KB
testcase_87 AC 127 ms
92,736 KB
testcase_88 AC 141 ms
92,692 KB
testcase_89 AC 119 ms
92,236 KB
testcase_90 AC 180 ms
93,164 KB
testcase_91 AC 143 ms
93,020 KB
testcase_92 AC 224 ms
93,784 KB
testcase_93 AC 181 ms
93,472 KB
testcase_94 AC 133 ms
92,780 KB
testcase_95 AC 167 ms
93,192 KB
testcase_96 AC 140 ms
92,844 KB
testcase_97 AC 219 ms
93,448 KB
testcase_98 AC 220 ms
93,608 KB
testcase_99 AC 152 ms
93,052 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]
    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:
            if right != -100:
                ans = 1
            else:
                ans = 0
        elif you == 24:
            if left != -100:
                ans = -1
            else:
                ans = 0
        else:
            if sum(P[0:you]) > sum(P[you + 1 : 25]):
                ans = -1
            else:
                ans = 1
    else:
        if center >= left and center >= right:
            ans = 0
        elif left >= center and left >= right:
            ans = -1
        elif right >= center and right >= left:
            ans = 1

    you = you + ans
    dist = distance(grid, you)

    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