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 |
已经无力吐槽这道题了!!!先是想都没想用了spfa,果断TLE,后来改了一个记忆化搜索(用的静态开辟的邻接表map[MAXN][50]),去不断RE,让我想测试数据会不会是单个顶点与n多的点邻接,于是改了个链表实现的邻接表,果断又因为不断开辟空间以及回收空间TLE,不得已又用老方法,结果是卡在map[MAXN][150]上过了!!!而: 10782129 Admiral 3249 Accepted 60884K 1844MS C++ 1334B 我真是。。。 不说什么了! Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator