洛谷P3916 图的遍历

题目链接：https://www.luogu.org/problemnew/show/P3916

题目大意

　　略。

分析

　　以终为始，逆向思维。

代码如下

 #include <bits/stdc++.h>
 using namespace std;

 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 #define Rep(i,n) for (int i = 0; i < (n); ++i)
 #define For(i,s,t) for (int i = (s); i <= (t); ++i)
 #define rFor(i,t,s) for (int i = (t); i >= (s); --i)
 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)

 #define pr(x) cout << #x << " = " << x << "  "
 #define prln(x) cout << #x << " = " << x << endl

 #define LOWBIT(x) ((x)&(-x))

 #define ALL(x) x.begin(),x.end()
 #define INS(x) inserter(x,x.begin())

 #define ms0(a) memset(a,0,sizeof(a))
 #define msI(a) memset(a,inf,sizeof(a))
 #define msM(a) memset(a,-1,sizeof(a))

 #define MP make_pair
 #define PB push_back
 #define ft first
 #define sd second

 template<typename T1, typename T2>
 istream &operator>>(istream &in, pair<T1, T2> &p) {
     in >> p.first >> p.second;
     return in;
 }

 template<typename T>
 istream &operator>>(istream &in, vector<T> &v) {
     for (auto &x: v)
         in >> x;
     return in;
 }

 template<typename T1, typename T2>
 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
     out << "[" << p.first << ", " << p.second << "]" << "\n";
     return out;
 }

 inline int gc(){
     static const int BUF = 1e7;
     static char buf[BUF], *bg = buf + BUF, *ed = bg;

     if(bg == ed) fread(bg = buf, , BUF, stdin);
     return *bg++;
 } 

 inline int ri(){
     int x = , f = , c = gc();
     for(; c<||c>; f = c=='-'?-:f, c=gc());
     for(; c>&&c<; x = x* + c - , c=gc());
     return x*f;
 }

 typedef long long LL;
 typedef unsigned long long uLL;
 typedef pair< double, double > PDD;
 typedef pair< int, int > PII;
 typedef pair< int, PII > PIPII;
 typedef pair< string, int > PSI;
 typedef pair< int, PSI > PIPSI;
 typedef set< int > SI;
 typedef vector< int > VI;
 typedef vector< VI > VVI;
 typedef vector< PII > VPII;
 typedef map< int, int > MII;
 typedef map< int, PII > MIPII;
 typedef map< string, int > MSI;
 typedef multimap< int, int > MMII;
 //typedef unordered_map< int, int > uMII;
 typedef pair< LL, LL > PLL;
 typedef vector< LL > VL;
 typedef vector< VL > VVL;
 typedef priority_queue< int > PQIMax;
 typedef priority_queue< int, VI, greater< int > > PQIMin;
 const double EPS = 1e-;
 const LL inf = 0x7fffffff;
 const LL infLL = 0x7fffffffffffffffLL;
 const LL mod = 1e9 + ;
 const int maxN = 1e5 + ;
 const LL ONE = ;
 const LL evenBits = 0xaaaaaaaaaaaaaaaa;
 const LL oddBits = 0x5555555555555555;

 struct Edge{
     int from, to;
 };

 struct Vertex{
     VI edges;
 };

 int N, M;
 int A[maxN];
 bitset< maxN > vis;
 Edge e[maxN];
 int elen;
 Vertex v[maxN];

 void dfs(int x, int a) {
     A[x] = a;
     vis[x] = ;
     foreach(i, v[x].edges) {
         int y = e[*i].to;
         if(!vis[y]) dfs(y, a);
     }
 }

 int main(){
     //freopen("MyOutput.txt","w",stdout);
     //freopen("input.txt","r",stdin);
     INIT();
     N = ri();
     M = ri();
     Rep(i, M) {
         int x, y;
         x = ri();
         y = ri();
         if(x == y) continue;
         e[++elen].from = y;
         e[elen].to = x;
         v[y].edges.PB(elen);
     }

     rFor(i, N, ) if(!vis[i]) dfs(i, i);

     For(i, , N) cout << A[i] << " ";
     cout << endl;
     return ;
 }