Submission #180971
Source Code Expand
n = int(raw_input()) a = map(int, raw_input().split()) cnt = 0 i = 0 b = [0] a.sort() while a[-1] > i: b.append(1) b.append(0) b.append(1) b.append(0) b.append(0) b.append(0) i = i + 7 def arrange(a, cnt): for j in range(len(a)): while b[a[j]] == 0: if b[a[j]] == 0: a[j] -= 1 cnt += 1 return a, cnt a, cnt = arrange(a, cnt) print cnt
Submission Info
Submission Time | |
---|---|
Task | B - 花占い |
User | kametaso |
Language | Python (2.7.3) |
Score | 0 |
Code Size | 455 Byte |
Status | RE |
Exec Time | 111 ms |
Memory | 8240 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | test_1.txt, test_112358.txt, test_1379137913.txt, test_1414213562.txt, test_1732151817.txt, test_2.txt, test_2236167977.txt, test_2645751311.txt, test_3.txt, test_3141592653.txt, test_4.txt, test_5.txt, test_6.txt, test_6666666666.txt, test_7.txt, test_73.txt, test_8.txt, test_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 58 ms | 3384 KB |
sample_02.txt | AC | 49 ms | 3376 KB |
test_1.txt | AC | 49 ms | 3304 KB |
test_112358.txt | AC | 50 ms | 3388 KB |
test_1379137913.txt | AC | 49 ms | 3388 KB |
test_1414213562.txt | AC | 49 ms | 3388 KB |
test_1732151817.txt | AC | 49 ms | 3328 KB |
test_2.txt | AC | 50 ms | 3372 KB |
test_2236167977.txt | AC | 49 ms | 3372 KB |
test_2645751311.txt | RE | 111 ms | 8236 KB |
test_3.txt | AC | 49 ms | 3376 KB |
test_3141592653.txt | AC | 48 ms | 3380 KB |
test_4.txt | AC | 50 ms | 3384 KB |
test_5.txt | AC | 49 ms | 3384 KB |
test_6.txt | AC | 49 ms | 3316 KB |
test_6666666666.txt | AC | 48 ms | 3388 KB |
test_7.txt | RE | 107 ms | 8240 KB |
test_73.txt | RE | 109 ms | 8240 KB |
test_8.txt | AC | 49 ms | 3388 KB |
test_9.txt | AC | 49 ms | 3388 KB |