Submission #1341130
Source Code Expand
N = int(input()) A = [int(_) for _ in input().split()] def color(n): if 1 <= n <= 399: return 0 elif 400 <= n <= 799: return 1 elif 800 <= n <= 1199: return 2 elif 1200 <= n <= 1599: return 3 elif 1600 <= n <= 1999: return 4 elif 2000 <= n <= 2399: return 5 elif 2400 <= n <= 2799: return 6 elif 2800 <= n <= 3199: return 7 else: return 8 x = [color(a) for a in A] unique = len(set(x)) dora = x.count(8) min_ = unique if dora == 0 else unique - 1 max_ = unique if dora == 0 else min(8, unique - 1 + dora) print(min_, max_)
Submission Info
Submission Time | |
---|---|
Task | C - Colorful Leaderboard |
User | kfukuta |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 664 Byte |
Status | WA |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | WA | 17 ms | 3064 KB |
in2.txt | AC | 17 ms | 3064 KB |
in3.txt | WA | 17 ms | 3064 KB |
in4.txt | WA | 17 ms | 3064 KB |
in5.txt | AC | 17 ms | 3064 KB |
s1.txt | AC | 17 ms | 3064 KB |
s2.txt | AC | 17 ms | 3064 KB |
s3.txt | AC | 18 ms | 3064 KB |