折戟沉沙

tarjan缩点后,若有出度为0的,输出其强联通块的大小,否则无解#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) for(int i=a;i>=b;i-

题目大意:求联通块的数量 显然可以想到tarjan缩点之后统计出度为0的点的数量 但这题会MLE#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) fo