图论
努力的气球
这个作者很懒,什么都没留下…
展开
-
B. Vasya and Isolated Vertices
B. Vasya and Isolated Verticestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has got an undirected graph consisting of n...原创 2018-10-13 23:14:34 · 11116 阅读 · 0 评论 -
Play on Words UVA - 10129(哈密顿)
Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solveit to open that doors. Because there is no other way to open the doors, the puzzle is very imp...原创 2018-11-23 23:13:23 · 6494 阅读 · 0 评论 -
Ordering Tasks UVA - 10305
John hasntasks to do. Unfortunately, the tasks are not independent and the execution of one task isonly possible if other tasks have already been executed.InputThe input will consist of seve...原创 2018-11-22 23:48:08 · 6520 阅读 · 0 评论 -
畅通工程 HDU - 1232(并查集的模板题)
某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路?Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N ( < 1000 )和道路数目M;随后的M行对应M条道路,每行给出一...原创 2018-11-24 12:17:13 · 6502 阅读 · 0 评论 -
Dijkstra板子n^2(起点为0,而不是1)
#include <bits/stdc++.h>#define INF 0x3f3f3f3fusing namespace std;int n,m;//节点数和边数int dis[105];//记录每个点到源点的距离int mapi[105][105];//记录边int vis[105];//记录这个点是否被选中过void dijkstra(int s){//s是源点...原创 2019-03-14 20:11:39 · 11060 阅读 · 0 评论