結果
問題 | No.5017 Tool-assisted Shooting |
ユーザー |
![]() |
提出日時 | 2023-07-16 17:19:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 250 ms / 2,000 ms |
コード長 | 3,566 bytes |
コンパイル時間 | 651 ms |
コンパイル使用メモリ | 87,288 KB |
実行使用メモリ | 94,352 KB |
スコア | 2,166,216 |
平均クエリ数 | 801.27 |
最終ジャッジ日時 | 2023-07-16 17:19:34 |
合計ジャッジ時間 | 27,167 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge17 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 100 |
ソースコード
# 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 npimport sysimport os# sys.setrecursionlimit(10**6) # PyPyだと遅いINF = 10**18MOD = 998244353# MOD = 10**9 + 7isTest = os.path.exists("input.txt")File = open("input.txt", "r") if isTest else sys.stdindef 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 -1for i in range(60):if grid[i][now][0]:return ireturn -1# 列で得られるポイントを求める関数def totalPoint(grid, idx):if not 0 <= idx <= 24:return -1total = 0dist = 0for i in range(60):if grid[i][idx][0]:if grid[i][idx][0] > (i - dist) * (total_power // 100 + 1):breakdist = itotal += grid[i][idx][2]else:return totalif total == 0:return -100else:return totalyou = 12move = ["S", "R", "L"]score = 0turn = 0total_power = 0grid = [[(0, 0, 0) for _ in range(25)] for _ in range(60)]one = 1while True:n = int(input())if n == -1:breakenemy = [list(map(int, input().split())) for _ in range(n)]moveGrid(grid)for h, p, x in enemy:grid[59][x] = (h, p, h)ans = 0center = 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 *= -1ans = oneif one == 1:dist = distance(grid, you + 1)else:dist = distance(grid, you - 1)elif center == 0:if left == -100 and right == -100:ans = 0dist = distance(grid, you)elif left > right:ans = -1dist = distance(grid, you - 1)else:ans = 1dist = distance(grid, you + 1)else:if center >= left and center >= right:ans = 0dist = distance(grid, you)elif left >= center and left >= right:ans = -1dist = distance(grid, you - 1)elif right >= center and right >= left:ans = 1dist = distance(grid, you + 1)you = you + ansif 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 += 1if turn == 1000:breakif isTest:outFile.close()