|
|
back to boardSuch easy problem , A big Hint ! Posted by XueMao 16 Mar 2003 14:20 you can only use dfs , but don't forget to sort the team . When I use sorting as from short to long , I got TL , but when from long to short , only 0.02s ! Re: Such easy problem , A big Hint ! I sort from long to short, but still Time Limited Exceeded. Can you tell me why? Re: Such easy problem , A big Hint ! :) Edited by author 23.12.2018 21:36 Edited by author 23.12.2018 21:39 Re: Such easy problem , A big Hint ! I was expecting TLE, because I use O(N^N), but in fact got AC in 0.015 I wonder if people who get TLE are doing something like O(N^N^N^π^e) lol |
|
|