Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

(n^2)*logn TLE 额。。。

Posted by alpc62 at 2007-09-24 13:58:13 on Problem 2002
In Reply To:Re:枚举对角线用hash处理一下就差不多了 Posted by:ichoyb at 2007-07-11 14:07:00

搜两个点形成一条边构造出两个正方形，再用map分别判段另外两个点是否存在；
最后排序去重

(n^2)*logn TLE 额。。。

按对角线排序，然后构造正方形哈希，复杂度不一样吗？

Followed by:

Post your reply here: