Submission #998927
Source Code Expand
N = 2**input() A = [int(raw_input()) for _ in xrange(N)] while N > 1: for i in xrange(N/2): if A[i*2] > A[i*2+1]: A[i] = A[i*2] - A[i*2+1] elif A[i*2] == A[i*2+1]: A[i] = A[i*2] else: A[i] = A[i*2+1] - A[i*2] N /= 2 print A[0]
Submission Info
Submission Time | |
---|---|
Task | C - Kode Festival |
User | nebukuro09 |
Language | Python (2.7.6) |
Score | 100 |
Code Size | 307 Byte |
Status | AC |
Exec Time | 637 ms |
Memory | 11012 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.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, subtask1_18.txt, subtask1_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 16 ms | 2568 KB |
sample_02.txt | AC | 16 ms | 2568 KB |
subtask1_01.txt | AC | 16 ms | 2568 KB |
subtask1_02.txt | AC | 16 ms | 2568 KB |
subtask1_03.txt | AC | 17 ms | 2568 KB |
subtask1_04.txt | AC | 16 ms | 2568 KB |
subtask1_05.txt | AC | 54 ms | 3204 KB |
subtask1_06.txt | AC | 16 ms | 2568 KB |
subtask1_07.txt | AC | 93 ms | 3588 KB |
subtask1_08.txt | AC | 323 ms | 6788 KB |
subtask1_09.txt | AC | 18 ms | 2692 KB |
subtask1_10.txt | AC | 628 ms | 11012 KB |
subtask1_11.txt | AC | 601 ms | 10884 KB |
subtask1_12.txt | AC | 606 ms | 11012 KB |
subtask1_13.txt | AC | 637 ms | 11012 KB |
subtask1_14.txt | AC | 615 ms | 10884 KB |
subtask1_15.txt | AC | 619 ms | 11012 KB |
subtask1_16.txt | AC | 628 ms | 11012 KB |
subtask1_17.txt | AC | 606 ms | 11012 KB |
subtask1_18.txt | AC | 624 ms | 11012 KB |
subtask1_19.txt | AC | 611 ms | 11012 KB |