```cpp
if(cnt>=10000000){
printf("%.2lf",ans);
exit(0);
}```
您的这部分应该是卡时吧
by littlep001 @ 2024-03-01 18:54:19
~~那肯定搜索数量一大就寄了呀~~
by littlep001 @ 2024-03-01 18:55:07
建议写状压
by Nuyoah_awa @ 2024-03-01 18:58:21
避免卡时被 Hack 的话可以写一些玄学排序,让感觉上相对优的解先被搜到
这题还是写状压 DP 比较好,反正也不难
by Illus1onary_Real1ty @ 2024-03-01 18:59:00
@[Max_FWL](/user/638491) 好的,但是我不会
by xishengming @ 2024-03-01 19:00:17
其实这道题的dfs应该已经趋势了,基本怎么优化都过不去了
by return_TLE @ 2024-03-01 19:01:24
@[xishengming](/user/996280)
by return_TLE @ 2024-03-01 19:02:38
@[return_TLE](/user/912241) 好的
by xishengming @ 2024-03-01 19:03:35
dfs记忆化应该能过去吧
by littlep001 @ 2024-03-01 19:04:10
@[littlep001](/user/922855) 呃我这个以前好像确实没有试过,但是剪枝应该已经被彻底卡下去了
by return_TLE @ 2024-03-01 19:05:52