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:出个加强版:In Reply To:出个加强版: Posted by:tasty at 2014-08-03 14:18:10 > 原来的题目改成 数据范围 0<=fx,fy,tx,ty<=10^9,m个向量 0<m<=100, > > 0<=mx,my<=100,abs(mx)+abs(my)!=0 ,然后 放上0<=n<=100个障碍物,求从(fx,fy)走到(tx,ty)的最短路,并且统计出最短路的走法数 mod (10^9+7),大家考虑一下, > > 哪天有闲心了我蛋疼一个代码 出点数据验证一下 加到某OJ上。。。。 大家可以一起研究一下有木有NB的做法。。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator