結果
問題 | No.1279 Array Battle |
ユーザー | McGregorsh |
提出日時 | 2023-05-09 13:18:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 317 ms / 2,000 ms |
コード長 | 1,663 bytes |
コンパイル時間 | 292 ms |
コンパイル使用メモリ | 87,324 KB |
実行使用メモリ | 93,736 KB |
最終ジャッジ日時 | 2023-08-17 06:14:43 |
合計ジャッジ時間 | 7,150 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
91,884 KB |
testcase_01 | AC | 240 ms
91,936 KB |
testcase_02 | AC | 242 ms
92,008 KB |
testcase_03 | AC | 242 ms
91,940 KB |
testcase_04 | AC | 249 ms
91,900 KB |
testcase_05 | AC | 246 ms
92,076 KB |
testcase_06 | AC | 250 ms
91,948 KB |
testcase_07 | AC | 247 ms
91,972 KB |
testcase_08 | AC | 250 ms
92,072 KB |
testcase_09 | AC | 252 ms
91,892 KB |
testcase_10 | AC | 248 ms
91,904 KB |
testcase_11 | AC | 253 ms
92,888 KB |
testcase_12 | AC | 252 ms
93,132 KB |
testcase_13 | AC | 264 ms
93,736 KB |
testcase_14 | AC | 254 ms
93,508 KB |
testcase_15 | AC | 286 ms
93,128 KB |
testcase_16 | AC | 301 ms
93,160 KB |
testcase_17 | AC | 305 ms
93,224 KB |
testcase_18 | AC | 317 ms
93,380 KB |
testcase_19 | AC | 314 ms
93,464 KB |
ソースコード
import sys, re from fractions import Fraction 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, ROUND_HALF_UP 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 = int(input()) A = i_list() B = i_list() score = defaultdict(int) p = 0 for per in permutations([i for i in range(N)], N): cou = 0 for i in range(N): if A[per[i]] > B[i]: cou += A[per[i]] - B[i] score[cou] += 1 p = max(p, cou) print(score[p]) if __name__ == '__main__': main()