Detail of message

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和5000ms一样反映问题

Posted by frkstyc at 2005-09-19 21:31:21 on Problem 2329
In Reply To:1s 好了 O(n^4)的方法刚刚好1170ms Posted by:zzningxp at 2005-09-19 21:28:36

Followed by:

2000ms 吧! 5000ms实在是没意思 (0) zzningxp 2005-09-19 21:34:54
- 这题时限应该改小一点，O（N^3）都能过 (0) zhougelin 2005-09-19 22:53:20
  - 对啊对啊时限最好改成100ms (0) cscjzz 2005-09-19 22:59:17
    - 恩，100最好 (0) semonteer 2005-09-19 23:05:01
      - 0吧,多么漂亮的数字 (0) frkstyc 2005-09-19 23:09:43
        不过说正经的，5000的确有些大， 2000 比较好，总不能卡掉所有的算法，只让一种算法过吧？ (0) semonteer 2005-09-19 23:13:48
        偶只想到了n^2的算法 :'( (14) cscjzz 2005-09-19 23:16:44
        hawk 有没有看到呢? (18) zzningxp 2005-09-21 20:13:34
        无聊不无聊啊 (0) Ikki 2005-09-22 09:00:57

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator