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

Re:出个加强版：

Posted by tasty at 2014-08-28 20:17:41 on Problem 3985 and last updated at 2014-08-28 20:20:55
In Reply To:Re:出个加强版： Posted by:tasty at 2014-08-03 15:19:54

> 貌似 mod(10^9+7)太大了 改成 mod( 10007)

改进了一下算法(没有实现)，不过复杂度最坏情况貌似是 
O(mx^4*n^2*log(mod))+ O(mod) 预处理
所以数据量需要缩小成 1<=m<=10 ,1<=mx<=10,1<=my<=10, n<=50, mod<=10007 ,1<=fx,fy<=10^9...   没有蛋疼出更好地做法

poj 3985原题的复杂度是 O(mx^4*m) 无压力

Followed by:

Post your reply here:

Home Page Go Back To top