#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N,M; class SCC { public: static const int MV = 2025000; vector > SC; int NV,GR[MV]; private: vector E[MV], RE[MV], NUM; int vis[MV]; public: void init(int NV) { this->NV=NV; for(int i=0;i=0;i--) if(!vis[NUM[i]]){ SC[c].clear(); revdfs(NUM[i],c); sort(SC[c].begin(),SC[c].end()); c++; } SC.resize(c); } }; vector E[202020]; SCC scc; int in[202020],out[202020]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>M; scc.init(N); FOR(i,M) { cin>>x>>y; E[x-1].push_back(y-1); scc.add_edge(x-1,y-1); } scc.scc(); FOR(i,N) { FORR(e,E[i]) if(scc.GR[i]!=scc.GR[e]) { in[scc.GR[e]]=1; out[scc.GR[i]]=1; } } if(scc.SC.size()==1) { cout<<0<