Tarjan
文章平均质量分 70
JacquesdeH
.
展开
-
Codevs 2822 爱在心中 [强连通分量] [Tarjan]
2822 爱在心中 时间限制: 1 s 空间限制: 128000 KB 题目等级 : 钻石 Diamond题目描述 Description “每个人都拥有一个梦,即使彼此不相同,能够与你分享,无论失败成功都会感动。爱因为在心中,平凡而不平庸,世界就像迷宫,却又让我们此刻相逢Our Home。”在爱的国度里有N个人,在他们的心中都有着一个爱的名单,上面记载着他所爱的人(不会出现自爱的情况原创 2016-08-10 00:28:04 · 602 阅读 · 0 评论 -
HDU 1269 迷宫城堡 [强连通分量] [Tarjan]
迷宫城堡 Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uDescription 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道原创 2016-08-10 00:34:37 · 291 阅读 · 0 评论 -
POJ 1236 IOI 1236 Network of School [强连通分量] [缩点]
Network of Schools Time Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %lld & %lluDescription A number of schools are connected to a computer network. Agreements have been developed原创 2016-08-10 22:57:31 · 344 阅读 · 0 评论 -
UVA 11324 The Largest Clique [强连通分量] [拓扑排序&dp]
The Largest Clique Time Limit: 3000MS 64bit IO Format: %lld & %lluDescription Given a directed graph G, consider the following transformation. First, create a new graph T(G) to have the sam原创 2016-08-10 23:53:52 · 360 阅读 · 0 评论 -
UVA 10765 Doves and bombs [点双连通分量] [Tarjan] [求割顶]
Doves and bombs 64bit IO Format: %lld & %lluDescription It is the year 95 ACM (After the Crash of Microsoft). After many years of peace, a war has broken out. Your na-tion, the island of Evergreen Ma原创 2016-08-11 00:07:54 · 523 阅读 · 0 评论 -
UVAlive 5135 Mining Your Own Business [点双连通分量] [求割顶]
Mining Your Own Business Time Limit: 5000MS 64bit IO Format: %lld & %lluDescription John Digger is the owner of a large illudium phosdex mine. The mine is made up of a series of tunnels that原创 2016-08-11 11:39:00 · 455 阅读 · 0 评论 -
UVAlive 3523 Knights of the Round Table [点双连通分量] [Tarjan]
Knights of the Round Table Time Limit: 4500MS 64bit IO Format: %lld & %lluDescription Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, an原创 2016-08-11 15:21:23 · 457 阅读 · 0 评论 -
NOIP模拟题 2016.9.24 [贪心] [有依赖的背包问题] [图论] [spfa或tarjan缩点+DAGdp]
1.排座椅 (seat.pas/c/cpp) 【问题描述】 上课的时候总有一些同学和前后左右的人交头接耳,这是令小学班主任十分头疼的一件事情。不过,班主任小雪发现了一些有趣的现象,当同学们的座次确定下来之后,只有有限的D对同学上课时会交头接耳。同学们在教室中坐成了M行N列,坐在第i行第j列 的同学的位置是(i,j),为了方便同学们进出,在教室中设置了K条横向的通道,L条纵向的通道。于是,聪明原创 2016-09-26 00:44:36 · 709 阅读 · 1 评论 -
NOIP模拟题 2016.10.6 [并查集] [联通性] [Tarjan]
T1 ,图的连通性 题意:给一个图,支持删除操作,询问任意时刻两个点的连通性观察到只有删除操作,那么可以考虑倒着处理 先把所有将来会删除的边删掉,然后从最后一组询问倒着处理 并查集维护连通性 这里的强制在线是骗人的 在任意时刻图中剩下的边数都是可以离线处理出来的 一个小trick 重边,删除的时候只删除一条 用set 或者map判断当前该边的数量 {cnt,disable} 当cn原创 2016-10-06 16:44:12 · 650 阅读 · 0 评论