cf295b

原创 2016年05月31日 20:30:48
B. Greg and Graph
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 cincout streams of the %I64dspecifier.

Examples
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—warshall

#include<bits/stdc++.h>
using namespace std;
int x[505];
int a[505];
__int64 dp[505][505];
int n;
__int64 res[505];
int vis[505];
void floyd()
{
    int cot=1;
    int g=n;
    for(int k=1;k<=n;k++)
    {
        __int64 ans=0;
        vis[a[k]]=1;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                dp[i][j]=min(dp[i][j],dp[i][a[k]]+dp[a[k]][j]);
                if(vis[i]&&vis[j])
                {
                    ans+=dp[i][j];
                }
            }
        }
        res[g--]=ans;


    }
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            scanf("%I64d",&dp[i][j]);
        }
    }
    for(int i=n;i>=1;i--)
    {
        scanf("%d",&a[i]);
    }
    floyd();
    for(int i=1;i<n;i++)
    {
        printf("%I64d ",res[i]);
    }
    printf("%I64d\n",res[n]);
    return 0;
}

挺经典

解析:

从后往前用每个点依次去松弛

因为从最后一个点去松弛,然后在用倒数第二个点去松弛,假设现在就有两个点,那末所有最短路就是倒数第一个点加上倒数第二个点的所有最短路径,再用倒数第三个点去松弛,这时候就相当于只有三个点,把这三个点两两最短路相加,再用倒数第四个点去松弛,这就相当于只有四个点,相加最短路,再用倒数第五个点去松弛,这就相当于有五个点!

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

CF 295B

 这是一个最短路问题,给出一个图的邻接矩阵,按照所给顺序删除图中的点,然后去求删除该点之前的最短路。 可以这样思考,删除的逆向也就是加点,按照删除顺序的逆序依次向图中加点,求出每次添加点之后的...

B. Two Buttons(Codeforces Round #295(div2))

B. Two Buttons time limit per test 2 seconds memory limit per test 256 megabytes input s...
  • caduca
  • caduca
  • 2015年03月02日 18:21
  • 2974

Codeforces Round #295 (Div. 1) B. Cubes

两个人轮流取方块,取完方块必须使剩下的稳定,先手要求取数大,后手反之。问最后的m进制数是多少。。。。用STL维护一下。。。 #include #include #include #incl...

Codeforces Round #295 (Div. 2) B. Two Buttons

ACM codeforces bfs 贪心 dp

Codeforces Round #295 (Div. 2) -- B. Two Buttons (模拟)

B. Two Buttons time limit per test 2 seconds memory limit per test 256 megabytes input standar...

stl模拟 Codeforces Round #295 (Div. 1) B. Cubes

题解: Basically, the first player should maximize the lexicographical order of numbers, and the seco...

Codeforces Round #295 B. Two Buttons

B. Two Buttons time limit per test 2 seconds memory limit per test 256 megabytes in...

【CodeForces】295B Greg and Graph 离线算法 Floyd

题目大意: 给定有向图,每次删去一个点,求sum{dis(i,j)},notdel(i)&¬del(j)。 离线处理,把删除变成插入。 从后往前,每插入一个结点i,就更新任意两点的最短路径,...

Codeforces Round #295 (Div. 1) B. Cubes (STL+类拓扑)

最近课业繁重,这题写了两天。。昨晚睡觉的时候才突然想到了最后一点的解决方法。 不知道该不该叫做拓扑。。感觉还是挺像的。。就把标题称之为类拓扑了。。这题的方法是用map来标记状态是否存在,然后用类似拓...

codeforces 295B Greg and Graph [Floyed]

Greg and Graph Time Limit: 3000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:cf295b
举报原因:
原因补充:

(最多只允许输入30个字)