 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
TLE~~In Reply To:我用O(n+m)的2-sat判。。依然超时，不知道过了的大牛有什么好的方法或者优化？ Posted by:panther at 2006-01-27 19:25:39 我只建一次邻接表，在表中记录这样一个信息：该边在距离小于等于多少的时候存在。然后排序，这样在求强连通分量的时候，只需要考虑已有的边。 仍然TLE。。。还有什么好的优化方法？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
