提出 #6556460

ソースコード 拡げる

import bisect

a = input().split()
a = [int(i) for i in a]

b = input().split()
b = [int(i) for i in b]
b.sort()

c = input().split()
c = [int(i) for i in c]
c.sort()
c = c[::-1]

d = c[:]
d[0] += a[3]
for i in range(1, len(d)):
   d[i] += d[i - 1]

eng = sum(c[:a[2]]) + a[3]

for i in range(1, len(b)):
   b[i] += b[i - 1]


if eng >= b[-1]:
   print("Yes")
   k = bisect.bisect(d, b[-1])
   if d[k - 1] == b[-1]:
       print(k)
   else:
       print(k + 1)
else:
   print("No")
   print(bisect.bisect(b, eng))

提出情報

提出日時
問題 E - Osmium_1008と課題
ユーザ lzhjiuzhi
言語 Python (3.4.3)
得点 300
コード長 547 Byte
結果 AC
実行時間 372 ms
メモリ 34624 KiB

ジャッジ結果

セット名 Sample Subtask1
得点 / 配点 0 / 0 300 / 300
結果
AC × 4
AC × 47
セット名 テストケース
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, small_01.txt, small_02.txt, small_03.txt, small_04.txt, small_05.txt, small_06.txt, small_07.txt, small_08.txt, small_09.txt, small_10.txt, small_11.txt, small_12.txt, small_13.txt, small_14.txt, small_15.txt, small_16.txt, small_17.txt, small_18.txt, small_19.txt, small_20.txt, large_01.txt, large_02.txt, large_03.txt, large_04.txt, large_05.txt, large_06.txt, large_07.txt, large_08.txt, large_09.txt, large_10.txt, large_11.txt, large_12.txt, large_13.txt, large_14.txt, large_15.txt, large_16.txt, large_17.txt, large_18.txt, large_19.txt, large_20.txt, corner_01.txt, corner_02.txt, corner_03.txt
ケース名 結果 実行時間 メモリ
corner_01.txt AC 19 ms 3064 KiB
corner_02.txt AC 22 ms 3188 KiB
corner_03.txt AC 20 ms 3064 KiB
large_01.txt AC 248 ms 24256 KiB
large_02.txt AC 214 ms 22180 KiB
large_03.txt AC 203 ms 22472 KiB
large_04.txt AC 217 ms 22076 KiB
large_05.txt AC 324 ms 30004 KiB
large_06.txt AC 145 ms 16012 KiB
large_07.txt AC 201 ms 24180 KiB
large_08.txt AC 106 ms 12080 KiB
large_09.txt AC 101 ms 12464 KiB
large_10.txt AC 228 ms 22532 KiB
large_11.txt AC 181 ms 20620 KiB
large_12.txt AC 107 ms 13504 KiB
large_13.txt AC 304 ms 28900 KiB
large_14.txt AC 116 ms 12884 KiB
large_15.txt AC 212 ms 23148 KiB
large_16.txt AC 224 ms 22892 KiB
large_17.txt AC 372 ms 34624 KiB
large_18.txt AC 124 ms 14960 KiB
large_19.txt AC 56 ms 7696 KiB
large_20.txt AC 194 ms 19892 KiB
sample_01.txt AC 20 ms 3064 KiB
sample_02.txt AC 19 ms 3064 KiB
sample_03.txt AC 19 ms 3064 KiB
sample_04.txt AC 19 ms 3064 KiB
small_01.txt AC 21 ms 3188 KiB
small_02.txt AC 20 ms 3064 KiB
small_03.txt AC 22 ms 3188 KiB
small_04.txt AC 20 ms 3064 KiB
small_05.txt AC 20 ms 3064 KiB
small_06.txt AC 20 ms 3064 KiB
small_07.txt AC 21 ms 3188 KiB
small_08.txt AC 21 ms 3188 KiB
small_09.txt AC 20 ms 3064 KiB
small_10.txt AC 22 ms 3188 KiB
small_11.txt AC 20 ms 3064 KiB
small_12.txt AC 20 ms 3064 KiB
small_13.txt AC 20 ms 3064 KiB
small_14.txt AC 21 ms 3188 KiB
small_15.txt AC 20 ms 3064 KiB
small_16.txt AC 21 ms 3188 KiB
small_17.txt AC 20 ms 3064 KiB
small_18.txt AC 20 ms 3064 KiB
small_19.txt AC 21 ms 3188 KiB
small_20.txt AC 21 ms 3064 KiB