当前位置：首页 > news >正文

洛谷P3469 [POI2008]BLO-Blockade

news 来源：原创 2024/4/28 4:53:56

题目描述

There are exactly

Some towns are connected by bidirectional roads.

There are no crossroads outside towns, though there may be bridges, tunnels and flyovers. Each pair of towns may be connected by at most one direct road. One can get from any town to any other-directly or indirectly.

Each town has exactly one citizen.

For that reason the citizens suffer from loneliness.

It turns out that each citizen would like to pay a visit to every other citizen (in his host's hometown), and do it exactly once. So exactly $n\cdot (n-1)n⋅(n−1) visits should take place.$

That's right, should.

Unfortunately, a general strike of programmers, who demand an emergency purchase of software, is under way.

As an act of protest, the programmers plan to block one town of Byteotia, preventing entering it, leaving it, and even passing through.

As we speak, they are debating which town to choose so that the consequences are most severe.

Task Write a programme that:

reads the Byteotian road system's description from the standard input, for each town determines, how many visits could take place if this town were not blocked by programmers, writes out the outcome to the standard output.

给定一张无向图，求每个点被封锁之后有多少个有序点对(x,y)(x!=y,1<=x,y<=n)满足x无法到达y

输入输出格式

输入格式：

In the first line of the standard input there are two positive integers: $(1\le n\le 100\ 0001≤n≤100 000, 1\le m\le 500\ 0001≤m≤500 000) denoting the number of towns and roads, respectively.$

The towns are numbered from 1 to

The following

Each line contains two integers $(1\le a<b\le n1≤a<b≤n) and denotes a direct road between towns numbered aa and bb.$

输出格式：

Your programme should write out exactly $i^{th}ith line should contain the number of visits that could not take place if the programmers blocked the town no. ii.$

输入输出样例

输入样例#1：复制

输出样例#1：复制

#include<iostream>
#include<cstdio>
#include<cstring>
#define maxn 100010
#ifdef WIN32
#define PLL "%I64d"
#else
#define PLL "%lld"
#endif
using namespace std;
int n,m,cnt;
int dfn[maxn],low[maxn],sz[maxn],head[maxn],num;
long long ans[maxn];
struct node{
    int to,pre;
}e[500010*2];
void Insert(int from,int to){
    e[++num].to=to;
    e[num].pre=head[from];
    head[from]=num;
}
void Tarjan(int now){
    int z=0;sz[now]=1;
    dfn[now]=low[now]=++cnt;
    for(int i=head[now];i;i=e[i].pre){
        int to=e[i].to;
        if(!dfn[to]){
            Tarjan(to);
            sz[now]+=sz[to];
            low[now]=min(low[now],low[to]);
            if(dfn[now]<=low[to]){
                ans[now]+=1LL*z*sz[to];
                z+=sz[to];
            }
        }
        else low[now]=min(low[now],dfn[to]);
    }
    ans[now]+=1LL*z*(n-z-1);
}
int main(){
    scanf("%d%d",&n,&m);
    int x,y;
    for(int i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        Insert(x,y);Insert(y,x);
    }
    for(int i=1;i<=n;i++)
        if(!dfn[i])Tarjan(i);
    for(int i=1;i<=n;i++)
        printf(PLL"\n",(ans[i]+n-1)<<1);
    return 0;
}