Submission #6976874
Source Code Expand
r,n,m=map(int,input().split()) a=[] b=[] step=2*r/n for i in range(1,n+m): if 1<=i<=n-1: a.append((r**2-(r-step*i)**2)**0.5*2) else: a.append(0) for i in range(1-m,n): if 1<=i<=n-1: b.append((r**2-(r-step*i)**2)**0.5*2) else: b.append(0) print(sum([max(a[i],b[i]) for i in range(len(a))]))
Submission Info
Submission Time | |
---|---|
Task | B - ステップカット |
User | KyleKatarn |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 355 Byte |
Status | AC |
Exec Time | 333 ms |
Memory | 12568 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 10_rand_06.txt, 10_rand_07.txt, 10_rand_08.txt, 20_hand_01.txt, 20_hand_02.txt, 20_hand_03.txt, 20_hand_04.txt, 20_hand_05.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 17 ms | 3064 KB |
00_example_02.txt | AC | 17 ms | 3064 KB |
00_example_03.txt | AC | 259 ms | 10264 KB |
10_rand_01.txt | AC | 17 ms | 3064 KB |
10_rand_02.txt | AC | 17 ms | 3060 KB |
10_rand_03.txt | AC | 133 ms | 6296 KB |
10_rand_04.txt | AC | 19 ms | 3064 KB |
10_rand_05.txt | AC | 31 ms | 3316 KB |
10_rand_06.txt | AC | 25 ms | 3316 KB |
10_rand_07.txt | AC | 60 ms | 4212 KB |
10_rand_08.txt | AC | 43 ms | 3700 KB |
20_hand_01.txt | AC | 250 ms | 10136 KB |
20_hand_02.txt | AC | 333 ms | 12568 KB |
20_hand_03.txt | AC | 245 ms | 10136 KB |
20_hand_04.txt | AC | 17 ms | 3060 KB |
20_hand_05.txt | AC | 17 ms | 3064 KB |