[TOEFL] tarjan+拓撲排序+bitset優化

n<=30000,m<=60000 Code #include<bits/stdc++.h> #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) using namespace std; const int N=3e4+100; struct node{int y,n;}

>>阅读原文<<