結果
問題 | No.110 しましまピラミッド |
ユーザー | McGregorsh |
提出日時 | 2022-06-15 22:19:07 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,106 bytes |
コンパイル時間 | 155 ms |
コンパイル使用メモリ | 83,040 KB |
実行使用メモリ | 83,744 KB |
最終ジャッジ日時 | 2024-04-15 07:32:02 |
合計ジャッジ時間 | 4,946 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 134 ms
83,396 KB |
testcase_01 | AC | 126 ms
83,688 KB |
testcase_02 | AC | 126 ms
83,044 KB |
testcase_03 | AC | 127 ms
83,516 KB |
testcase_04 | AC | 130 ms
83,600 KB |
testcase_05 | AC | 129 ms
83,344 KB |
testcase_06 | AC | 126 ms
83,356 KB |
testcase_07 | AC | 126 ms
83,356 KB |
testcase_08 | AC | 124 ms
83,660 KB |
testcase_09 | AC | 126 ms
83,344 KB |
testcase_10 | AC | 125 ms
83,252 KB |
testcase_11 | AC | 124 ms
83,656 KB |
testcase_12 | AC | 126 ms
83,224 KB |
testcase_13 | AC | 124 ms
83,276 KB |
testcase_14 | WA | - |
testcase_15 | AC | 125 ms
83,000 KB |
testcase_16 | AC | 125 ms
83,448 KB |
testcase_17 | AC | 126 ms
82,908 KB |
testcase_18 | AC | 127 ms
83,028 KB |
testcase_19 | AC | 126 ms
83,444 KB |
testcase_20 | AC | 126 ms
83,100 KB |
testcase_21 | AC | 127 ms
83,316 KB |
testcase_22 | AC | 126 ms
82,912 KB |
testcase_23 | WA | - |
testcase_24 | AC | 126 ms
83,348 KB |
testcase_25 | AC | 127 ms
83,404 KB |
testcase_26 | AC | 128 ms
82,904 KB |
testcase_27 | AC | 128 ms
83,228 KB |
testcase_28 | WA | - |
testcase_29 | AC | 127 ms
82,876 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n1 = int(input()) w = i_list() n2 = int(input()) b = i_list() nums = [] for i in range(n1): nums.append([w[i], 0]) for i in range(n2): nums.append([b[i], 1]) nums.sort() numa = 0 for i in range(len(nums)): if nums[i][0] == 0: numa = i break numb = 0 for i in range(len(nums)): if nums[i][0] == 1: numb = i break #print(nums) score = nums[numa][0] now = nums[numa][1] ans1 = 1 for i in range(numa, len(nums)): if now != nums[i][1] and score < nums[i][0]: ans1 += 1 now = nums[i][1] score = nums[i][0] score = nums[numb][0] now = nums[numb][1] ans2 = 1 for i in range(numb, len(nums)): if now != nums[i][1] and score < nums[i][0]: ans2 += 1 now = nums[i][1] score = nums[i][0] print(max(ans1, ans2)) if __name__ == '__main__': main()