查看完整版本: 優質艷人妻 SUE LING

:verygood: :verygood: :verygood:

:clap: :clap: :clap:

[隱藏廣告]

Thank s for sharing

thx for share~!

thx for sharing

来比试一下一杆进洞。

看帖是欣赏，回帖是鼓励

:P :P :P :P :P :P :P :P

Great！Thanks and support！

！！！！！！！！！！

thanks for your sharing

:verygood:

thanks a lot

回復 1# 的帖子

thanks for sharing

Thanks for sharing

want more pls

thanks for sharing

:loveliness: :loveliness: :loveliness:

Good. She sure is honry.

Thanks for sharing...

:loveeyes: :loveeyes:

Great and thanks for sharing

ggggggggggggg

:verygood:

:verygood: :verygood:

*** 作者被禁止或刪除 內容自動屏蔽 ***

nice wow, thanks

Good.......

thank you very much............

很讚的文章，謝謝咯！

bbbbbbbbbbbbbbbbbbbbbbbbbbb

:loveliness: :loveliness: :loveliness: :loveliness: :loveliness: :loveliness: :loveliness:

Thanks for sharing

*** 作者被禁止或刪除 內容自動屏蔽 ***

thanks for sharing :loveeyes:

Thanks for your sharing.

多謝分享，多謝分享。

謝謝大大!!^_^

Thanks very much.

thanks for sharing

:loveliness: w

thanks for sharing

thanks for sharing

/*

Name:

Copyright: lzt2002

Author: lzt2002

Date: 20/08/15 22:18

Description:
*/
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
#define havetxt 0
#define shuru "input.txt"
#define shuchu "output.txt"
#define inf 0x7fffffff
#define esp 1e-9
#define mod 1000000007

typedef long long ll;

int u[22222],s[22222],v[22222],mark;
vector<int> adj[22222],G[22222];
int n,m,c;
int nin[22222],nout[22222];

void dfs1(int x)
{
    u[x]=1;
    for(int i=0;i<G[x].size();i++)
    {
        if(!u[G[x][i]]) dfs1(G[x][i]);
    }
    s[c++]=x;
}

void dfs2(int x)
{

if(u[x]!=0) return;
    u[x]=mark;
    for(int i=0;i<adj[x].size();i++)
    {
        if(!u[adj[x][i]]) dfs2(adj[x][i]);
    }
}

int main()
{
    int T;

cin>>T;

while(T--)

{

memset(u,0,sizeof(u));

memset(G,0,sizeof(G));

memset(adj,0,sizeof(adj));

mark=0;

c=0;



cin>>n>>m;
   
for(int i=0;i<m;i++)
   
{
   
    int a,b;
   
    cin>>a>>b;
   
   
        
G[a].push_back(b);
        
adj[b].push_back(a);
   
}
   

   
for(int i=1;i<=n;i++)
   
{
   
    if(!u[i]) dfs1(i);
   
}
   

   
memset(u,0,sizeof(u));

   
for(int i=n-1;i>=0;i--)
   
{
        
if(!u[s[i]])
        
{
        
++mark;
        
    dfs2(s[i]);
        
}
        }



if(mark==1)

{

cout<<0<<endl;

continue;

}



memset(nin,0,sizeof(nin));

memset(nout,0,sizeof(nout));



for(int i=1;i<=n;i++)

{

for(int j=0;j<G[i].size();j++)

{

if(u[i]!=u[G[i][j]])

{

nin[u[G[i][j]]]++;

nout[u[i]]++;

}

}

}



int nin0=0,nout0=0;

for(int i=1;i<=mark;i++)

{

if(nin[i]==0)

{

nin0++;

}

else if(nout[i]==0)

{

nout0++;

}

}



cout<<max(nin0,nout0)<<endl;
    }

    return 0;
}

*** 作者被禁止或刪除 內容自動屏蔽 ***

優質艷人妻 SUE LING

:loveliness:

Asdfghjklpoiuytrewqasd

Cccccccccccccccc

:loveeyes:

Goooooooooooooooooooood