結果
問題 | No.5017 Tool-assisted Shooting |
ユーザー |
![]() |
提出日時 | 2023-07-16 15:58:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 248 ms / 2,000 ms |
コード長 | 4,475 bytes |
コンパイル時間 | 456 ms |
コンパイル使用メモリ | 87,124 KB |
実行使用メモリ | 94,804 KB |
スコア | 1,498,424 |
平均クエリ数 | 902.68 |
最終ジャッジ日時 | 2023-07-16 15:59:15 |
合計ジャッジ時間 | 25,047 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
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):for i in range(60):if grid[i][now][0]:return ireturn -1you = 12move = ["S", "R", "L"]score = 0turn = 0total_power = 0grid = [[(0, 0, 0) for _ in range(25)] for _ in range(60)]while 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 = 0dist = distance(grid, you)if dist == -1:if you == 0:distR = distance(grid, you + 1)flagR = distR == -1 or grid[distR][you + 1][0] <= (distR - 1) * (total_power // 100 + 1)if flagR:ans = 1else:ans = 0elif you == 24:distL = distance(grid, you - 1)flagL = distL == -1 or grid[distL][you - 1][0] <= (distL - 1) * (total_power // 100 + 1)if flagL:ans = -1else:ans = 0else:distL = distance(grid, you - 1)distR = distance(grid, you + 1)flagL = distL == -1 or grid[distL][you - 1][0] <= (distL - 1) * (total_power // 100 + 1)flagR = distR == -1 or grid[distR][you + 1][0] <= (distR - 1) * (total_power // 100 + 1)if flagL and flagR:if grid[distL][you - 1][2] > grid[distR][you + 1][2]:ans = -1else:ans = 1elif flagL and not flagR:ans = -1elif not flagL and flagR:ans = 1else:ans = 0else:if grid[dist][you][0] > dist * (total_power // 100 + 1):if you == 0:distR = distance(grid, you + 1)flagR = distR == -1 or grid[distR][you + 1][0] <= (distR - 1) * (total_power // 100 + 1)if flagR:ans = 1else:ans = 0elif you == 24:distL = distance(grid, you - 1)flagL = distL == -1 or grid[distL][you - 1][0] <= (distL - 1) * (total_power // 100 + 1)if flagL:ans = -1else:ans = 0else:distL = distance(grid, you - 1)distR = distance(grid, you + 1)if (grid[distL][you - 1][0] > (distL - 1) * (total_power // 100 + 1)and distL > 0):ans = 1else:ans = -1else: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)you = you + ans# print(me)if isTest:outFile.write(move[ans] + "\n")else:print(move[ans], flush=True)turn += 1if turn == 1000:break# print(score)if isTest:outFile.close()