結果
問題 | No.110 しましまピラミッド |
ユーザー | kutsutama |
提出日時 | 2021-11-29 18:47:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 75 ms / 5,000 ms |
コード長 | 1,600 bytes |
コンパイル時間 | 269 ms |
コンパイル使用メモリ | 86,692 KB |
実行使用メモリ | 71,336 KB |
最終ジャッジ日時 | 2023-09-15 09:02:21 |
合計ジャッジ時間 | 4,301 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,020 KB |
testcase_01 | AC | 70 ms
70,780 KB |
testcase_02 | AC | 70 ms
71,032 KB |
testcase_03 | AC | 70 ms
71,328 KB |
testcase_04 | AC | 73 ms
71,332 KB |
testcase_05 | AC | 70 ms
71,100 KB |
testcase_06 | AC | 71 ms
71,100 KB |
testcase_07 | AC | 72 ms
71,264 KB |
testcase_08 | AC | 71 ms
71,280 KB |
testcase_09 | AC | 71 ms
71,036 KB |
testcase_10 | AC | 75 ms
70,836 KB |
testcase_11 | AC | 74 ms
71,096 KB |
testcase_12 | AC | 74 ms
71,336 KB |
testcase_13 | AC | 73 ms
71,120 KB |
testcase_14 | AC | 74 ms
70,980 KB |
testcase_15 | AC | 75 ms
71,248 KB |
testcase_16 | AC | 75 ms
71,132 KB |
testcase_17 | AC | 73 ms
71,096 KB |
testcase_18 | AC | 73 ms
71,016 KB |
testcase_19 | AC | 71 ms
71,116 KB |
testcase_20 | AC | 75 ms
71,056 KB |
testcase_21 | AC | 72 ms
71,260 KB |
testcase_22 | AC | 72 ms
71,236 KB |
testcase_23 | AC | 71 ms
71,236 KB |
testcase_24 | AC | 72 ms
70,936 KB |
testcase_25 | AC | 73 ms
71,080 KB |
testcase_26 | AC | 73 ms
71,060 KB |
testcase_27 | AC | 72 ms
71,076 KB |
testcase_28 | AC | 73 ms
71,032 KB |
testcase_29 | AC | 74 ms
71,128 KB |
ソースコード
nw = int(input()) whiteBrick = [int(x) for x in input().split()] nb = int(input()) blackBrick = [int(x) for x in input().split()] res = 0 whiteBrick.sort(reverse=True) blackBrick.sort(reverse=True) whiteNow = 0 blackNow = 0 now = 1000 whiteSaki = 0 for i in range(nw + nb): if whiteNow >= nw: break whiteFind = False for iw in range(whiteNow, nw): if whiteBrick[iw] < now: now = whiteBrick[iw] whiteNow = iw + 1 whiteSaki += 1 whiteFind = True break if not whiteFind: break if blackNow >= nb: break blackFind = False for ib in range(blackNow, nb): if blackBrick[ib] < now: now = blackBrick[ib] blackNow = ib + 1 whiteSaki += 1 blackFind = True break if not blackFind: break whiteNow = 0 blackNow = 0 now = 1000 blackSaki = 0 for i in range(nw + nb): if blackNow >= nb: break blackFind = False for ib in range(blackNow, nb): if blackBrick[ib] < now: now = blackBrick[ib] blackNow = ib + 1 blackSaki += 1 blackFind = True break if not blackFind: break if whiteNow >= nw: break whiteFind = False for iw in range(whiteNow, nw): if whiteBrick[iw] < now: now = whiteBrick[iw] whiteNow = iw + 1 blackSaki += 1 whiteFind = True break if not whiteFind: break res = max(whiteSaki, blackSaki) print(res)