Submission #1769101


Source Code Expand

def b_price(N, X, A):
    ans = 0
    for i in range(N):
        k = 1 << i
        if X & k == k: #Xを2進数表記したとき、b_kが1か(b_0が最下位ビット)
            ans += A[i]
    return ans
  
N,X = [int(_) for _ in input().split()]
A = [int(_) for _ in input().split()]
print(b_price(N, X, A))

Submission Info

Submission Time
Task B - 価格の合計
User kenseiQ
Language Python (3.4.3)
Score 100
Code Size 322 Byte
Status AC
Exec Time 18 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 20
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
All subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 17 ms 2940 KB
subtask0_sample02.txt AC 17 ms 2940 KB
subtask0_sample03.txt AC 17 ms 3060 KB
subtask1_01.txt AC 17 ms 2940 KB
subtask1_02.txt AC 17 ms 2940 KB
subtask1_03.txt AC 17 ms 3060 KB
subtask1_04.txt AC 17 ms 2940 KB
subtask1_05.txt AC 17 ms 2940 KB
subtask1_06.txt AC 17 ms 3060 KB
subtask1_07.txt AC 18 ms 2940 KB
subtask1_08.txt AC 17 ms 2940 KB
subtask1_09.txt AC 17 ms 2940 KB
subtask1_10.txt AC 17 ms 3060 KB
subtask1_11.txt AC 17 ms 3060 KB
subtask1_12.txt AC 17 ms 2940 KB
subtask1_13.txt AC 18 ms 2940 KB
subtask1_14.txt AC 17 ms 2940 KB
subtask1_15.txt AC 17 ms 3060 KB
subtask1_16.txt AC 17 ms 2940 KB
subtask1_17.txt AC 17 ms 2940 KB