CQUPT OJ 首页 题库 比赛 评测 排名 讨论 帮助
登录 注册
编号 题目 状态 分数 总时间 内存 代码 / 答案文件 提交者 提交时间
#22086 #2040. 四倍大甜甜花 Wrong Answer 35 2714 ms 3728 K Python 3 / 210 B 192023210428 2024-12-14 23:45:35 
tp=[int(k) for k in input().split()]
a,b,c,p,q,r=tp[0],tp[1],tp[2],tp[3]*0.01,tp[4]*0.01,tp[5]
def dfs(m):
    if m<b:
        return 0
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
print(dfs(a))
子任务 #1
Wrong Answer
得分：35
测试点 #1
Accepted
得分：100
用时：20 ms
内存：2876 KiB

输入文件（01.in） 

4 2 1 10 25 1

答案文件（01.out） 

2.200000000000000000000000000000

用户输出 

2.2

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #2
Accepted
得分：100
用时：22 ms
内存：2888 KiB

输入文件（02.in） 

4 2 1 10 90 1

答案文件（02.out） 

2.901000000000000000000000000000

用户输出 

2.9010000000000002

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #3
Wrong Answer
得分：0
用时：23 ms
内存：3616 KiB

输入文件（03.in） 

4 2 1 0 50 2

答案文件（03.out） 

4.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #4
Wrong Answer
得分：0
用时：23 ms
内存：3660 KiB

输入文件（04.in） 

5 2 1 0 50 2

答案文件（04.out） 

4.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #5
Accepted
得分：100
用时：20 ms
内存：2784 KiB

输入文件（05.in） 

15 14 33 47 100 8

答案文件（05.out） 

48.510000000000000000000000000000

用户输出 

48.510000000000005

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #6
Accepted
得分：100
用时：21 ms
内存：2828 KiB

输入文件（06.in） 

160 128 14 2 74 35

答案文件（06.out） 

14.280000000000000000000000000000

用户输出 

14.28

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #7
Accepted
得分：100
用时：22 ms
内存：2812 KiB

输入文件（07.in） 

289 76 39 24 74 13

答案文件（07.out） 

163.010814720000000000000000000000

用户输出 

163.01081472

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #8
Time Limit Exceeded
得分：0
用时：1051 ms
内存：2864 KiB

输入文件（08.in） 

894 59 26 36 53 43

答案文件（08.out） 

620.982881678869313980873870419556
测试点 #9
Accepted
得分：100
用时：20 ms
内存：2760 KiB

输入文件（09.in） 

271 194 94 60 1 97

答案文件（09.out） 

150.400000000000000000000000000000

用户输出 

150.4

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #10
Accepted
得分：100
用时：21 ms
内存：2820 KiB

输入文件（10.in） 

8581 8337 20 9 87 7821

答案文件（10.out） 

21.800000000000000000000000000000

用户输出 

21.8

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #11
Accepted
得分：100
用时：21 ms
内存：2872 KiB

输入文件（11.in） 

41764 36019 87 41 62 27877

答案文件（11.out） 

122.670000000000000000000000000000

用户输出 

122.67

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #12
Accepted
得分：100
用时：20 ms
内存：2788 KiB

输入文件（12.in） 

333625 284770 1 75 54 120896

答案文件（12.out） 

1.750000000000000000000000000000

用户输出 

1.75

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #13
Wrong Answer
得分：0
用时：23 ms
内存：3580 KiB

输入文件（13.in） 

1 1 1 0 0 1

答案文件（13.out） 

1.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #14
Wrong Answer
得分：0
用时：23 ms
内存：3656 KiB

输入文件（14.in） 

1000000 1 1 10 25 1

答案文件（14.out） 

1333333.333333333333333333333333333333

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #15
Wrong Answer
得分：0
用时：23 ms
内存：3692 KiB

输入文件（15.in） 

1000000 1 100 10 25 1

答案文件（15.out） 

133333333.333333333333333333333333333333

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #16
Wrong Answer
得分：0
用时：23 ms
内存：3704 KiB

输入文件（16.in） 

1000000 10 1 100 100 1

答案文件（16.out） 

200000.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #17
Wrong Answer
得分：0
用时：25 ms
内存：3660 KiB

输入文件（17.in） 

1000000 1000000 100 0 0 1000000

答案文件（17.out） 

100.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #18
Accepted
得分：100
用时：21 ms
内存：2832 KiB

输入文件（18.in） 

476062 156944 94 24 33 57462

答案文件（18.out） 

349.680000000000000000000000000000

用户输出 

349.68

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #19
Accepted
得分：100
用时：27 ms
内存：2876 KiB

输入文件（19.in） 

585355 76124 30 13 89 33550

答案文件（19.out） 

351.503613690933880319145900000000

用户输出 

351.5036136909339

Special Judge 信息 

0.0000000000

系统信息 

Exited with return code 0
测试点 #20
Time Limit Exceeded
得分：0
用时：1002 ms
内存：2812 KiB

输入文件（20.in） 

260562 21141 66 3 32 18143

答案文件（20.out） 

1073.155897040059634712868284024031
测试点 #21
Wrong Answer
得分：0
用时：24 ms
内存：3612 KiB

输入文件（21.in） 

994882 982964 43 99 12 982964

答案文件（21.out） 

85.570000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #22
Wrong Answer
得分：0
用时：24 ms
内存：3668 KiB

输入文件（22.in） 

666693 541514 28 100 65 541514

答案文件（22.out） 

80.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #23
Wrong Answer
得分：0
用时：24 ms
内存：3728 KiB

输入文件（23.in） 

891302 247395 28 21 27 247395

答案文件（23.out） 

115.068493150684931506849315068493

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #24
Wrong Answer
得分：0
用时：26 ms
内存：3712 KiB

输入文件（24.in） 

678621 17554 34 11 84 17554

答案文件（24.out） 

8075.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #25
Wrong Answer
得分：0
用时：25 ms
内存：3696 KiB

输入文件（25.in） 

43158 38199 70 34 38 38199

答案文件（25.out） 

112.903225806451612903225806451613

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #26
Wrong Answer
得分：0
用时：24 ms
内存：3700 KiB

输入文件（26.in） 

971677 365988 35 23 95 365988

答案文件（26.out） 

1400.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #27
Wrong Answer
得分：0
用时：24 ms
内存：3656 KiB

输入文件（27.in） 

476062 156944 94 24 49 156944

答案文件（27.out） 

552.941176470588235294117647058824

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #28
Wrong Answer
得分：0
用时：23 ms
内存：3600 KiB

输入文件（28.in） 

585355 76124 30 13 3 76124

答案文件（28.out） 

237.300000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #29
Wrong Answer
得分：0
用时：23 ms
内存：3624 KiB

输入文件（29.in） 

260562 21141 66 3 64 21141

答案文件（29.out） 

2200.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #30
Wrong Answer
得分：0
用时：23 ms
内存：3696 KiB

输入文件（30.in） 

333625 284770 1 75 80 284770

答案文件（30.out） 

5.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
测试点 #31
Wrong Answer
得分：0
用时：23 ms
内存：3676 KiB

输入文件（31.in） 

1000000 1 1 99 99 1

答案文件（31.out） 

100000000.000000000000000000000000000000

标准错误流 

Traceback (most recent call last):
  File "/sandbox/2/a.py", line 7, in <module>
    print(dfs(a))
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  File "/sandbox/2/a.py", line 6, in dfs
    return max(c*p,(dfs(m-b+r)-dfs(m-b))*q)+c+dfs(m-b)
  [Previous line repeated 995 more times]
  File "/sandbox/2/a.py", line 4, in dfs
    if m<b:
RecursionError: maximum recursion depth exceeded in comparison

Special Judge 信息 

nan

系统信息 

Exited with return code 1
CQUPT OJ Powered by SYZOJ.