Codeforces 295B Greg and Graph
2015-11-26 21:34
453 查看
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:
The game consists of n steps.
On the i-th step Greg removes vertex number xi from the graph. As Greg removes a vertex, he also removes all the edges that go in and out of this vertex.
Before executing each step, Greg wants to know the sum of lengths of the shortest paths between all pairs of the remaining vertices. The shortest path can go through any remaining vertex. In other words, if we assume that d(i, v, u) is the shortest path between vertices v and u in the graph that formed before deleting vertex xi, then Greg wants to know the value of the following sum: .
Help Greg, print the value of the required sum before each step.
Input
The first line contains integer n (1 ≤ n ≤ 500) — the number of vertices in the graph.
Next n lines contain n integers each — the graph adjacency matrix: the j-th number in the i-th line aij (1 ≤ aij ≤ 105, aii = 0) represents the weight of the edge that goes from vertex i to vertex j.
The next line contains n distinct integers: x1, x2, …, xn (1 ≤ xi ≤ n) — the vertices that Greg deletes.
Output
Print n integers — the i-th number equals the required sum before the i-th step.
Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64d specifier.
Sample test(s)
input
1
0
1
output
0
input
2
0 5
4 0
1 2
output
9 0
input
4
0 3 1 1
6 0 400 1
2 4 0 1
1 1 1 0
4 1 2 3
output
17 23 404 0
解题思路:利用Floyd求解的思想,从后向前逐个加入相应的点,更新相应的距离矩阵即可,水题一枚~~~
The game consists of n steps.
On the i-th step Greg removes vertex number xi from the graph. As Greg removes a vertex, he also removes all the edges that go in and out of this vertex.
Before executing each step, Greg wants to know the sum of lengths of the shortest paths between all pairs of the remaining vertices. The shortest path can go through any remaining vertex. In other words, if we assume that d(i, v, u) is the shortest path between vertices v and u in the graph that formed before deleting vertex xi, then Greg wants to know the value of the following sum: .
Help Greg, print the value of the required sum before each step.
Input
The first line contains integer n (1 ≤ n ≤ 500) — the number of vertices in the graph.
Next n lines contain n integers each — the graph adjacency matrix: the j-th number in the i-th line aij (1 ≤ aij ≤ 105, aii = 0) represents the weight of the edge that goes from vertex i to vertex j.
The next line contains n distinct integers: x1, x2, …, xn (1 ≤ xi ≤ n) — the vertices that Greg deletes.
Output
Print n integers — the i-th number equals the required sum before the i-th step.
Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64d specifier.
Sample test(s)
input
1
0
1
output
0
input
2
0 5
4 0
1 2
output
9 0
input
4
0 3 1 1
6 0 400 1
2 4 0 1
1 1 1 0
4 1 2 3
output
17 23 404 0
解题思路:利用Floyd求解的思想,从后向前逐个加入相应的点,更新相应的距离矩阵即可,水题一枚~~~
#include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <string> #include <vector> #include <deque> #include <queue> #include <stack> #include <map> #include <set> #include <numeric> #include <utility> #include <algorithm> #include <functional> using namespace std; typedef long long ll; const int inf = 0x3f3f3f3f; const int maxn = 510; int g[maxn][maxn], gg[maxn][maxn]; int x[maxn]; int d[maxn][maxn]; bool have[maxn]; ll sum[maxn]; int n; int main() { //freopen("aa.in", "r", stdin); scanf("%d", &n); for(int i = 1; i <= n; ++i) { for(int j = 1; j <= n; ++j) { scanf("%d", &g[i][j]); } } for(int i = 1; i <= n; ++i) { scanf("%d", &x[i]); } memset(d, inf, sizeof(d)); memset(have, false, sizeof(have)); memset(sum, 0, sizeof(sum)); memset(gg, inf, sizeof(gg)); sum = 0; gg[x ][x ] = 0; have[x ] = true; d[x ][x ] = 0; for(int i = n - 1; i >= 1; --i) { for(int j = 1; j <= n; ++j) { gg[j][x[i]] = g[j][x[i]]; gg[x[i]][j] = g[x[i]][j]; } for(int j = 1; j <= n; ++j) { if(have[j]) { for(int k = 1; k <= n; ++k) { if(have[k]) { d[j][x[i]] = min(d[j][x[i]], d[j][k] + gg[k][x[i]]); d[x[i]][j] = min(d[x[i]][j], gg[x[i]][k] + d[k][j]); } } } } d[x[i]][x[i]] = 0; have[x[i]] = true; for(int j = 1; j <= n; ++j) { if(have[j]) { for(int k = 1; k <= n; ++k) { if(have[k]) { d[j][k] = min(d[j][k], d[j][x[i]] + d[x[i]][k]); sum[i] += d[j][k]; } } } } } for(int i = 1; i <= n; ++i) { printf("%I64d ", sum[i]); } printf("\n"); return 0; }
相关文章推荐
- 【C语言】找带环单链表的环入口
- 黑马程序员——Java笔记——String类常用方法
- UITextFieldDelegate协议中各个方法调用情况
- Stat
- 20135321余佳源、20135323符运锦----实验二:固件设计
- Operating System-Thread(2) Multi-Process-Parallel vs Multi-Thread-Parallel
- 606第十周周六赛 H - 1sting 大数据处理
- Nodejs 0.10.x 之Url模块
- TCP长连接与短连接的区别
- Delphi下获取IE的UserAgent的方法
- matlab的符号计算
- cocos2d-x俄罗斯方块--基于简单工厂的程序重构
- Delphi使用Windows API函数AnimateWindow实现窗体特效
- C语言中三种常见排序算法分析
- jsonp跨域解决方案
- java基础学习记录
- 习题3-4 周期串 解题报告
- 华为OJ题目(七):字符串加密
- 细数JDK里的设计模式
- 细数JDK里的设计模式