codeforces 295B Greg and Graph
来源:互联网 发布:ubuntu 15 安装教程 编辑:程序博客网 时间:2024/05/29 07:38
Description
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 numberxi 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 thatd(i, v, u) is the shortest path between verticesv and u in the graph that formed before deleting vertexxi, 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 lineaij(1 ≤ aij ≤ 105, aii = 0) represents the weight of the edge that goes from vertex i to vertexj.
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 inC++. It is preferred to use the cin, cout streams of the %I64d specifier.
Sample Input
101
0
20 54 01 2
9 0
40 3 1 16 0 400 12 4 0 11 1 1 04 1 2 3
17 23 404 0
对于删除顺序,我们可以怎么处理?
#include <cstdio>#include <cstring>#define maxn 510typedef long long LL;LL d[maxn][maxn];int seq[maxn];LL ans[maxn];inline LL min(LL a,LL b){ return a < b ? a : b;}void update(int s,int n){ for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) d[i][j] = min(d[i][s] + d[s][j],d[i][j]);}LL query(int s,int n){ LL sum = 0; for(int i = n,u = seq[i];i >= s;u = seq[--i]) for(int j = n,v = seq[j];j >= s;v = seq[--j]) sum += d[u][v]; return sum;}int main(){ int n; while(scanf("%d",&n) != EOF){ for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) scanf("%I64d",&d[i][j]); for(int i = 1;i <= n;i++) scanf("%d",&seq[i]); for(int i = n;i >= 1;i--){ update(seq[i],n); ans[i] = query(i,n); } for(int i = 1;i <= n;i++) printf("%I64d ",ans[i]); printf("\n"); } return 0;}
那些年,我们写过的三重循环~
- codeforces 295B Greg and Graph
- Codeforces 295B Greg and Graph
- codeforces 295B Greg and Graph [Floyed]
- 【codeforces 295B】Greg and Graph ( floyd )
- [Codeforces 295B]Greg and Graph(Floyd)
- codeforces 295B B. Greg and Graph(floyd+dp)
- CodeForces 295B - Greg and Graph Floyd的巧妙应用
- Codeforces 296D/295B(Greg and Graph)
- Codeforces 295 B Greg and Graph (Floyd_Warshall的深入理解)
- 【CodeForces】295B Greg and Graph 离线算法 Floyd
- CodeForces - 295B D - Greg and Graph(floyd算法)
- [CF]295B. Greg and Graph | Floyd
- 那些年我们写过的三重循环----CodeForces 295B Greg and Graph 重温Floyd算法
- Codeforces 296D Greg And Graph (逆向处理)Floyd
- codeforces 295A - Greg and Array
- CodeForces 295A Greg and Array
- codeforces 295D Greg and Caves
- Codeforces 295A Greg and Array
- 机房收费系统初想
- 高压电磁流量计的详细介绍及特点
- 为什么调用 FragmentPagerAdapter.notifyDataSetChanged() 并不能更新其 Fragment?
- cocos2d-x 3.2 物理碰撞机制
- ThreadLocal的奥秘
- codeforces 295B Greg and Graph
- Altium Designer 10常见问题及解决方法
- 使用window.navigator.userAgent属性判断浏览器类型及版本
- RadioButton
- aws Reserved Instance
- Linux之进程管理
- ORA-00911: 无效字符
- java中如何打印规定图案? 举例说明
- C#_WinForm接收命令行参数