Submission #5894227
Source Code Expand
N, X = map(int,input().split()) Ps = list(map(int,input().split())) ans = 0 for i in range(N): if X % (2**(i+1))>=2**(i): ans += Ps[i] print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - 価格の合計 |
User | TeruMiyake |
Language | PyPy3 (2.4.0) |
Score | 100 |
Code Size | 161 Byte |
Status | AC |
Exec Time | 174 ms |
Memory | 38412 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 164 ms | 38256 KB |
subtask0_sample02.txt | AC | 162 ms | 38256 KB |
subtask0_sample03.txt | AC | 162 ms | 38256 KB |
subtask1_01.txt | AC | 170 ms | 38256 KB |
subtask1_02.txt | AC | 164 ms | 38256 KB |
subtask1_03.txt | AC | 163 ms | 38256 KB |
subtask1_04.txt | AC | 164 ms | 38256 KB |
subtask1_05.txt | AC | 162 ms | 38256 KB |
subtask1_06.txt | AC | 164 ms | 38412 KB |
subtask1_07.txt | AC | 164 ms | 38256 KB |
subtask1_08.txt | AC | 162 ms | 38256 KB |
subtask1_09.txt | AC | 163 ms | 38256 KB |
subtask1_10.txt | AC | 172 ms | 38384 KB |
subtask1_11.txt | AC | 174 ms | 38256 KB |
subtask1_12.txt | AC | 165 ms | 38256 KB |
subtask1_13.txt | AC | 170 ms | 38256 KB |
subtask1_14.txt | AC | 171 ms | 38256 KB |
subtask1_15.txt | AC | 161 ms | 38256 KB |
subtask1_16.txt | AC | 167 ms | 38256 KB |
subtask1_17.txt | AC | 168 ms | 38256 KB |