Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-3463\":[\"Sightseeing\",2894,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBAPC+2006+Qualification\\\"\\u003eBAPC 2006 Qualification\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P8819\":[\"星战\",5275,\"CSP-S 2022\"],\"POJ-3635\":[\"Full Tank?\",3689,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNordic+2007\\\"\\u003eNordic 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3613\":[\"Cow Relays\",2873,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+November+Gold\\\"\\u003eUSACO 2007 November Gold\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P3825\":[\"游戏\",3495,\"NOI2017\"],\"洛谷-B3611\":[\"传递闭包\",6825,\"模板\"],\"洛谷-P4926\":[\"倍杀测量者\",2120,\"1007\"],\"POJ-2449\":[\"Remmarguts\\u0027 Date\",6326,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Zeyuan Zhu\\u003c/div\\u003e\"],\"CodeForces-613D\":[\"Kingdom and its Cities\",2913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/613\\\"\\u003eCodeforces Round 339 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P4171\":[\"满汉全席\",4938,\"JSOI2010\"],\"洛谷-P4180\":[\"严格次小生成树\",12382,\"BJWC2010\"],\"洛谷-P9534\":[\"广度优先遍历\",368,\"YsOI2023\"],\"洛谷-P6175\":[\"无向图的最小环问题\",7384,null],\"洛谷-P4630\":[\"铁人两项\",3071,\"APIO2018\"],\"洛谷-P7771\":[\"欧拉路径\",9485,\"模板\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"andyc_03","updateTime":1705472744000,"title":"图论1.17习题","dislikeCnt":0,"content":"\n\n-----\n\n**P6175** Floyd求最小环 [problem:洛谷-P6175]\n\n**POJ3613** 矩阵乘法优化最短路[problem:POJ-3613]\n\n**B3611** bitset优化传递闭包 [problem:洛谷-B3611]\n\n\n\n**POJ3463** 次短路[problem:POJ-3463]\n\n**POJ3635** dp/最短路[problem:POJ-3635]\n\n**POJ2449** K短路[problem:POJ-2449]\n\n\n **P4926** [1007] 倍杀测量者 [problem:洛谷-P4926]\n\n\n**P7771** 欧拉路径[problem:洛谷-P7771]\n\n\n**P4180** 严格次小生成树[problem:洛谷-P4180]\n\n\n**P9534** 广度优先遍历 思维+拓扑序[problem:洛谷-P9534]\n\n\n**CF613D** 虚树dp [problem:CodeForces-613D]\n\n\n**P4630** 圆方树 [problem:洛谷-P4630]\n\n\n**P8819** 综合练习 [problem:洛谷-P8819]\n\n**P4171** 2-SAT 板子 [problem:洛谷-P4171]\n\n**P3825** 2-SAT [problem:洛谷-P3825]\n","threadId":179926,"likeCnt":1,"createTime":1704948499000,"isWorkbook":true,"viewCnt":113,"openness":2,"fav":false,"id":4448,"trustable":false}