結果
問題 | No.989 N×Mマス計算(K以上) |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 23:11:34 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,738 bytes |
コンパイル時間 | 577 ms |
コンパイル使用メモリ | 87,196 KB |
実行使用メモリ | 112,352 KB |
最終ジャッジ日時 | 2023-08-24 23:21:53 |
合計ジャッジ時間 | 7,746 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,604 KB |
testcase_01 | AC | 233 ms
92,792 KB |
testcase_02 | AC | 234 ms
92,764 KB |
testcase_03 | AC | 236 ms
92,528 KB |
testcase_04 | AC | 232 ms
92,592 KB |
testcase_05 | AC | 235 ms
92,712 KB |
testcase_06 | WA | - |
testcase_07 | AC | 234 ms
92,744 KB |
testcase_08 | WA | - |
testcase_09 | AC | 233 ms
92,828 KB |
testcase_10 | AC | 325 ms
104,760 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 289 ms
105,816 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 310 ms
101,284 KB |
testcase_17 | AC | 290 ms
105,916 KB |
testcase_18 | AC | 307 ms
96,548 KB |
testcase_19 | AC | 315 ms
110,076 KB |
ソースコード
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, m, k = i_map() B = s_list() op = B[0] b = [] for i in range(1, m+1): b.append(int(B[i])) b.sort() a = [int(input()) for i in range(n)] a.sort() ans = 0 for i in range(n): num = a[i] if op == '+': point = k - num else: point = k // num score = bisect_left(b, point) ans += m - score #print(ans) print(ans) if __name__ == '__main__': main()