#892225 (PyPy3) No.5017 Tool-assisted Shooting

提出ソース

結果

問題	No.5017 Tool-assisted Shooting
ユーザー	とろちゃ
提出日時	2023-07-16 16:53:46
言語	PyPy3 (7.3.15)
結果	AC
実行時間	234 ms / 2,000 ms
コード長	3,428 bytes
コンパイル時間	383 ms
コンパイル使用メモリ	87,052 KB
実行使用メモリ	96,124 KB
スコア	766,443
平均クエリ数	560.81
最終ジャッジ日時	2023-07-16 16:54:09
合計ジャッジ時間	22,918 ms
ジャッジサーバーID （参考情報）	judge11 / judge13
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	138 ms 92,900 KB
testcase_01	AC	223 ms 94,140 KB
testcase_02	AC	212 ms 93,676 KB
testcase_03	AC	126 ms 92,184 KB
testcase_04	AC	136 ms 92,840 KB
testcase_05	AC	214 ms 93,152 KB
testcase_06	AC	207 ms 93,428 KB
testcase_07	AC	124 ms 92,860 KB
testcase_08	AC	128 ms 92,376 KB
testcase_09	AC	119 ms 92,368 KB
testcase_10	AC	134 ms 92,420 KB
testcase_11	AC	166 ms 93,428 KB
testcase_12	AC	156 ms 92,976 KB
testcase_13	AC	145 ms 93,884 KB
testcase_14	AC	129 ms 92,324 KB
testcase_15	AC	219 ms 94,024 KB
testcase_16	AC	227 ms 93,844 KB
testcase_17	AC	219 ms 93,892 KB
testcase_18	AC	209 ms 93,976 KB
testcase_19	AC	174 ms 93,252 KB
testcase_20	AC	222 ms 93,592 KB
testcase_21	AC	230 ms 96,124 KB
testcase_22	AC	211 ms 93,728 KB
testcase_23	AC	225 ms 93,560 KB
testcase_24	AC	131 ms 92,328 KB
testcase_25	AC	176 ms 93,540 KB
testcase_26	AC	216 ms 94,036 KB
testcase_27	AC	165 ms 93,492 KB
testcase_28	AC	221 ms 93,608 KB
testcase_29	AC	215 ms 93,404 KB
testcase_30	AC	113 ms 92,596 KB
testcase_31	AC	133 ms 92,616 KB
testcase_32	AC	125 ms 92,760 KB
testcase_33	AC	233 ms 95,516 KB
testcase_34	AC	113 ms 92,156 KB
testcase_35	AC	138 ms 92,360 KB
testcase_36	AC	157 ms 93,596 KB
testcase_37	AC	210 ms 93,804 KB
testcase_38	AC	143 ms 93,596 KB
testcase_39	AC	117 ms 92,180 KB
testcase_40	AC	223 ms 93,796 KB
testcase_41	AC	182 ms 92,864 KB
testcase_42	AC	128 ms 92,364 KB
testcase_43	AC	117 ms 92,252 KB
testcase_44	AC	167 ms 93,876 KB
testcase_45	AC	212 ms 93,556 KB
testcase_46	AC	135 ms 92,324 KB
testcase_47	AC	221 ms 94,188 KB
testcase_48	AC	214 ms 93,256 KB
testcase_49	AC	211 ms 93,416 KB
testcase_50	AC	124 ms 92,400 KB
testcase_51	AC	212 ms 93,932 KB
testcase_52	AC	112 ms 92,280 KB
testcase_53	AC	213 ms 93,840 KB
testcase_54	AC	121 ms 92,464 KB
testcase_55	AC	213 ms 93,452 KB
testcase_56	AC	140 ms 92,036 KB
testcase_57	AC	150 ms 93,784 KB
testcase_58	AC	206 ms 93,400 KB
testcase_59	AC	139 ms 92,392 KB
testcase_60	AC	119 ms 92,212 KB
testcase_61	AC	221 ms 94,040 KB
testcase_62	AC	153 ms 93,316 KB
testcase_63	AC	209 ms 93,588 KB
testcase_64	AC	159 ms 93,296 KB
testcase_65	AC	234 ms 94,680 KB
testcase_66	AC	215 ms 93,064 KB
testcase_67	AC	193 ms 93,152 KB
testcase_68	AC	134 ms 92,668 KB
testcase_69	AC	219 ms 93,776 KB
testcase_70	AC	125 ms 92,400 KB
testcase_71	AC	119 ms 92,908 KB
testcase_72	AC	148 ms 92,852 KB
testcase_73	AC	116 ms 92,024 KB
testcase_74	AC	220 ms 93,452 KB
testcase_75	AC	127 ms 92,148 KB
testcase_76	AC	159 ms 93,856 KB
testcase_77	AC	227 ms 93,528 KB
testcase_78	AC	118 ms 92,312 KB
testcase_79	AC	153 ms 92,948 KB
testcase_80	AC	167 ms 93,476 KB
testcase_81	AC	211 ms 93,232 KB
testcase_82	AC	219 ms 93,516 KB
testcase_83	AC	125 ms 92,848 KB
testcase_84	AC	119 ms 92,532 KB
testcase_85	AC	211 ms 93,492 KB
testcase_86	AC	169 ms 93,632 KB
testcase_87	AC	134 ms 92,300 KB
testcase_88	AC	130 ms 92,072 KB
testcase_89	AC	165 ms 93,060 KB
testcase_90	AC	123 ms 92,956 KB
testcase_91	AC	134 ms 92,184 KB
testcase_92	AC	214 ms 93,372 KB
testcase_93	AC	132 ms 92,276 KB
testcase_94	AC	223 ms 94,012 KB
testcase_95	AC	167 ms 92,872 KB
testcase_96	AC	145 ms 92,280 KB
testcase_97	AC	214 ms 94,064 KB
testcase_98	AC	133 ms 92,524 KB
testcase_99	AC	152 ms 93,436 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

# 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 -100

    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]
    return total


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:
        grid[59][x] = (h, p, h)

    ans = 0
    center = totalPoint(grid, you)
    left = totalPoint(grid, you - 1)
    right = totalPoint(grid, you + 1)
    if sum([center, left, right]) == 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")
    else:
        print(move[ans], flush=True)

    turn += 1
    if turn == 1000:
        break

# print(score)
if isTest:
    outFile.close()

yukicoder

結果

テストケース

ソースコード