Sparse Graph
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3078 Accepted Submission(s): 443
Now you are given an undirected graph G of N nodes and M bidirectional edges of unit length. Consider the complement of G , i.e., H . For a given vertex S on H , you are required to compute the shortest distances from S to all N−1 other vertices.
1 2 0 1
1
题解:
#include<stdio.h> #include<iostream> #include<stdlib.h> #include<vector> #include<map> #include<cstring> #include<string> #include<math.h> #include<set> #include<algorithm> #include<queue> using namespace std; queue<int>q; const int MAX=2e5+5; set<int> s[MAX],a,c; int pathlen[MAX]; set<int>::iterator it; int main() { int T; int n,m; scanf("%d",&T); while(T--) { memset(pathlen,-1,sizeof(pathlen)); a.clear(); scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { s[i].clear(); a.insert(i); } for(int i=1;i<=m;i++) { int u,v; scanf("%d%d",&u,&v); s[u].insert(v); s[v].insert(u); } int ss; scanf("%d",&ss); a.erase(ss); q.push(ss); pathlen[ss]=0; while(!q.empty()) { c.clear(); int now_pos=q.front(); q.pop(); for(it=a.begin();it!=a.end();it++) { int pos=*it; if(s[pos].find(now_pos)==s[pos].end()) { pathlen[pos]=pathlen[now_pos]+1; q.push(pos); c.insert(pos); } } for(it=c.begin();it!=c.end();it++) { a.erase(*it); } } int flag=0; for(int i=1;i<=n;i++) { if(i!=ss) flag?printf(" %d",pathlen[i]),flag++ : printf("%d",pathlen[i]),flag++; } } return 0; }