F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
Notice:1:注册本OJ方式请见https://www.lydsy.com/JudgeOnline/wttl/thread.php?tid=5671 2:请不要在讨论区中发空白主题帖。
大视野在线测评-欢迎您
[ New Thread ]
Problem 4023 >> 这题 我的方法要写 link cut tree 好麻烦啊
test_tset @ 2017-01-23 15:58:50
[ Quote ] [ Edit ] [ Delete ] 1#
没写过 lct....
test_tset @ 2017-01-23 15:59:54
[ Quote ] [ Edit ] [ Delete ] 2#
后缀树+lct+ 主席树 是可做滴。。。。
save_code @ 2018-09-03 17:49:39
[ Quote ] [ Edit ] [ Delete ] 3#
fhq treap 实现后缀平衡树:

http://uoj.ac/submission/282732
save_code @ 2018-09-03 17:50:39
[ Quote ] [ Edit ] [ Delete ] 4#
管理员放宽这道题时限吧, 30s估计应该够了。。。
save_code @ 2018-09-04 21:03:36
[ Quote ] [ Edit ] [ Delete ] 5#
uoj 上优化到 3.8s 优化不动了,求加时限
save_code @ 2018-09-04 21:07:34
[ Quote ] [ Edit ] [ Delete ] 6#
10组数据差不多放到 15s就够了。。。 bzoj 要比 uoj慢 3倍多。。。。
save_code @ 2018-09-12 09:27:01
[ Quote ] [ Edit ] [ Delete ] 7#
@ lavendir,改成 7s 吧, 优化了两个星期,在7s以内了。。。
save_code @ 2018-09-12 09:27:18
[ Quote ] [ Edit ] [ Delete ] 8#
实在是搞不动了。。。。
save_code @ 2018-09-12 09:28:08
[ Quote ] [ Edit ] [ Delete ] 9#
标算 uoj 上都跑了 20s,要知道 uoj 比bzoj 快了3倍多。。。。
[Top] [Previous Page] [Next Page]

HOME Back