Submission #3044430
Source Code Expand
from math import ceil N = int(input()) As = list(map(int, input().split())) # dpの右から(j+1)ビット目: 和がjである部分列が存在するならば1 dp = 1 for A in As: dp |= dp << A # 和がjである部分列が存在する、(ΣA/2)以上で最小のjが答え ans = ceil(sum(As) / 2) dp >>= ans while not (dp & 1): dp >>= 1 ans += 1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Median Sum |
User | ZollingerPython3 |
Language | Python (3.4.3) |
Score | 700 |
Code Size | 395 Byte |
Status | AC |
Exec Time | 561 ms |
Memory | 5464 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 2940 KB |
subtask_1_01.txt | AC | 17 ms | 2940 KB |
subtask_1_02.txt | AC | 17 ms | 3060 KB |
subtask_1_03.txt | AC | 17 ms | 3060 KB |
subtask_1_04.txt | AC | 18 ms | 3060 KB |
subtask_1_05.txt | AC | 453 ms | 5372 KB |
subtask_1_06.txt | AC | 561 ms | 5464 KB |
subtask_1_07.txt | AC | 218 ms | 4344 KB |
subtask_1_08.txt | AC | 218 ms | 4352 KB |
subtask_1_09.txt | AC | 217 ms | 4324 KB |
subtask_1_10.txt | AC | 507 ms | 5376 KB |
subtask_1_11.txt | AC | 454 ms | 5452 KB |
subtask_1_12.txt | AC | 522 ms | 5456 KB |
subtask_1_13.txt | AC | 367 ms | 4884 KB |
subtask_1_14.txt | AC | 284 ms | 4604 KB |
subtask_1_15.txt | AC | 275 ms | 4600 KB |
subtask_1_16.txt | AC | 244 ms | 4436 KB |
subtask_1_17.txt | AC | 239 ms | 4480 KB |
subtask_1_18.txt | AC | 223 ms | 4372 KB |
subtask_1_19.txt | AC | 222 ms | 4456 KB |
subtask_1_20.txt | AC | 221 ms | 4416 KB |
subtask_1_21.txt | AC | 442 ms | 5356 KB |
subtask_1_22.txt | AC | 431 ms | 5264 KB |
subtask_1_23.txt | AC | 419 ms | 5236 KB |
subtask_1_24.txt | AC | 407 ms | 5192 KB |
subtask_1_25.txt | AC | 17 ms | 3060 KB |
subtask_1_26.txt | AC | 17 ms | 2940 KB |
subtask_1_27.txt | AC | 17 ms | 2940 KB |
subtask_1_28.txt | AC | 17 ms | 2940 KB |
subtask_1_29.txt | AC | 17 ms | 3060 KB |
subtask_1_30.txt | AC | 17 ms | 2940 KB |
subtask_1_31.txt | AC | 17 ms | 3060 KB |
subtask_1_32.txt | AC | 17 ms | 3060 KB |
subtask_1_33.txt | AC | 17 ms | 3060 KB |
subtask_1_34.txt | AC | 17 ms | 3060 KB |
subtask_1_35.txt | AC | 22 ms | 3060 KB |
subtask_1_36.txt | AC | 478 ms | 5104 KB |
subtask_1_37.txt | AC | 18 ms | 3060 KB |
subtask_1_38.txt | AC | 558 ms | 5392 KB |