結果
問題 | No.989 N×Mマス計算(K以上) |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 23:11:34 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,738 bytes |
コンパイル時間 | 646 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 106,112 KB |
最終ジャッジ日時 | 2024-06-02 12:23:47 |
合計ジャッジ時間 | 4,250 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 113 ms
83,532 KB |
testcase_01 | AC | 114 ms
83,528 KB |
testcase_02 | AC | 118 ms
83,200 KB |
testcase_03 | AC | 115 ms
83,440 KB |
testcase_04 | AC | 114 ms
83,712 KB |
testcase_05 | AC | 114 ms
83,200 KB |
testcase_06 | WA | - |
testcase_07 | AC | 115 ms
83,456 KB |
testcase_08 | WA | - |
testcase_09 | AC | 113 ms
83,584 KB |
testcase_10 | AC | 207 ms
98,616 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 172 ms
97,444 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 188 ms
94,464 KB |
testcase_17 | AC | 169 ms
97,364 KB |
testcase_18 | AC | 184 ms
90,416 KB |
testcase_19 | AC | 195 ms
103,516 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()