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

提出ソース

結果

問題	No.5017 Tool-assisted Shooting
ユーザー	とろちゃ
提出日時	2023-07-16 18:59:09
言語	PyPy3 (7.3.15)
結果	AC
実行時間	277 ms / 2,000 ms
コード長	3,406 bytes
コンパイル時間	397 ms
コンパイル使用メモリ	86,964 KB
実行使用メモリ	95,244 KB
スコア	1,049,385
平均クエリ数	536.13
最終ジャッジ日時	2023-07-16 19:02:17
合計ジャッジ時間	26,017 ms
ジャッジサーバーID （参考情報）	judge12 / judge16
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	199 ms 94,184 KB
testcase_01	AC	163 ms 94,208 KB
testcase_02	AC	174 ms 93,784 KB
testcase_03	AC	167 ms 94,432 KB
testcase_04	AC	169 ms 93,324 KB
testcase_05	AC	257 ms 95,244 KB
testcase_06	AC	277 ms 94,968 KB
testcase_07	AC	149 ms 94,232 KB
testcase_08	AC	170 ms 94,224 KB
testcase_09	AC	151 ms 93,600 KB
testcase_10	AC	164 ms 94,392 KB
testcase_11	AC	220 ms 93,988 KB
testcase_12	AC	203 ms 94,228 KB
testcase_13	AC	172 ms 94,168 KB
testcase_14	AC	162 ms 93,548 KB
testcase_15	AC	186 ms 94,632 KB
testcase_16	AC	165 ms 94,408 KB
testcase_17	AC	244 ms 94,268 KB
testcase_18	AC	254 ms 94,836 KB
testcase_19	AC	197 ms 93,748 KB
testcase_20	AC	262 ms 94,676 KB
testcase_21	AC	263 ms 94,584 KB
testcase_22	AC	201 ms 94,304 KB
testcase_23	AC	230 ms 94,496 KB
testcase_24	AC	255 ms 94,596 KB
testcase_25	AC	166 ms 93,644 KB
testcase_26	AC	156 ms 93,696 KB
testcase_27	AC	205 ms 93,908 KB
testcase_28	AC	268 ms 94,640 KB
testcase_29	AC	232 ms 94,512 KB
testcase_30	AC	153 ms 94,060 KB
testcase_31	AC	172 ms 94,092 KB
testcase_32	AC	159 ms 93,456 KB
testcase_33	AC	155 ms 94,348 KB
testcase_34	AC	157 ms 93,796 KB
testcase_35	AC	160 ms 94,040 KB
testcase_36	AC	181 ms 94,156 KB
testcase_37	AC	262 ms 94,812 KB
testcase_38	AC	158 ms 94,220 KB
testcase_39	AC	149 ms 93,732 KB
testcase_40	AC	173 ms 94,384 KB
testcase_41	AC	154 ms 93,820 KB
testcase_42	AC	150 ms 93,376 KB
testcase_43	AC	167 ms 93,900 KB
testcase_44	AC	206 ms 94,692 KB
testcase_45	AC	177 ms 94,128 KB
testcase_46	AC	169 ms 94,280 KB
testcase_47	AC	211 ms 94,612 KB
testcase_48	AC	250 ms 95,024 KB
testcase_49	AC	275 ms 94,844 KB
testcase_50	AC	167 ms 94,272 KB
testcase_51	AC	193 ms 94,736 KB
testcase_52	AC	136 ms 93,628 KB
testcase_53	AC	154 ms 94,052 KB
testcase_54	AC	152 ms 94,052 KB
testcase_55	AC	225 ms 94,456 KB
testcase_56	AC	170 ms 93,952 KB
testcase_57	AC	211 ms 94,084 KB
testcase_58	AC	255 ms 94,288 KB
testcase_59	AC	255 ms 94,532 KB
testcase_60	AC	183 ms 93,764 KB
testcase_61	AC	270 ms 94,568 KB
testcase_62	AC	268 ms 94,368 KB
testcase_63	AC	268 ms 94,808 KB
testcase_64	AC	269 ms 94,884 KB
testcase_65	AC	146 ms 93,872 KB
testcase_66	AC	259 ms 94,912 KB
testcase_67	AC	242 ms 94,612 KB
testcase_68	AC	178 ms 93,756 KB
testcase_69	AC	230 ms 94,268 KB
testcase_70	AC	171 ms 93,920 KB
testcase_71	AC	148 ms 93,876 KB
testcase_72	AC	234 ms 94,496 KB
testcase_73	AC	146 ms 93,524 KB
testcase_74	AC	152 ms 93,604 KB
testcase_75	AC	189 ms 94,636 KB
testcase_76	AC	204 ms 94,864 KB
testcase_77	AC	161 ms 94,024 KB
testcase_78	AC	146 ms 93,720 KB
testcase_79	AC	262 ms 95,004 KB
testcase_80	AC	200 ms 93,628 KB
testcase_81	AC	253 ms 94,416 KB
testcase_82	AC	223 ms 94,280 KB
testcase_83	AC	183 ms 94,312 KB
testcase_84	AC	152 ms 93,996 KB
testcase_85	AC	258 ms 94,792 KB
testcase_86	AC	195 ms 94,352 KB
testcase_87	AC	159 ms 94,164 KB
testcase_88	AC	152 ms 93,456 KB
testcase_89	AC	162 ms 94,036 KB
testcase_90	AC	156 ms 93,896 KB
testcase_91	AC	161 ms 94,288 KB
testcase_92	AC	229 ms 94,472 KB
testcase_93	AC	252 ms 94,628 KB
testcase_94	AC	173 ms 94,284 KB
testcase_95	AC	248 ms 94,740 KB
testcase_96	AC	251 ms 94,456 KB
testcase_97	AC	244 ms 94,420 KB
testcase_98	AC	157 ms 93,492 KB
testcase_99	AC	165 ms 94,208 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
from random import *
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
    cnt = 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]
            cnt += 1
    else:
        return total
    if cnt == 0:
        if i != 0:
            return randint(0, 1)
        return -100
    else:
        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([i for i in [center, left, right] if i != -1]) == 0:
        if you == 0 or you == 24:
            one *= -1
        ans = one
        if one == 1:
            ans = 1
        else:
            ans = -1
    elif center == 0:
        if left == -100 and right == -100:
            ans = 0
        elif left > right:
            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("#" + str(score) + "\n")
    else:
        print(move[ans], flush=True)

    turn += 1
    if turn == 1000:
        break

if isTest:
    outFile.close()

yukicoder

結果

テストケース

ソースコード