結果
問題 | No.678 2Dシューティングゲームの必殺ビーム |
ユーザー | McGregorsh |
提出日時 | 2022-07-02 11:01:05 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,973 bytes |
コンパイル時間 | 268 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 93,344 KB |
最終ジャッジ日時 | 2023-08-18 02:05:32 |
合計ジャッジ時間 | 5,930 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
92,752 KB |
testcase_01 | AC | 239 ms
92,680 KB |
testcase_02 | AC | 236 ms
92,712 KB |
testcase_03 | AC | 240 ms
92,732 KB |
testcase_04 | AC | 240 ms
92,576 KB |
testcase_05 | AC | 239 ms
93,056 KB |
testcase_06 | AC | 241 ms
92,836 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 240 ms
93,088 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 242 ms
93,004 KB |
testcase_15 | AC | 247 ms
93,344 KB |
testcase_16 | AC | 246 ms
92,984 KB |
testcase_17 | WA | - |
ソースコード
import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n, left, right = i_map() nums = [] for i in range(n): a, b, c, d = i_map() nums.append([a, b, c, d, i]) nums.sort(reverse=True, key=lambda x:x[3]) ans = [0] * n juge = [True] * (right - left + 1) for i in range(n): xl, yu, xr, yd, num = nums[i] xl -= left if xl < 0: xl = 0 if xl >= right - left: xl = right - left xr -= left if xr < 0: xr = 0 if xr >= right - left: xr = right - left #print(xl, xr, num) for i in range(xl, xr+1): if juge[i]: ans[num] = 1 juge[i] = False for i in ans: print(i) if __name__ == '__main__': main()