foyercat 2015-11-20 13:20
:clap: :clap: :clap: :clap:
andrewcpy1 2015-11-20 13:40
thanks for sharing
h80302433 2015-11-20 13:44
thx for sharing~~~~~~
rajonrondo 2015-11-20 23:28
;P ;P ;P :wave: :wave:
thomaskatat 2015-11-20 23:35
Gooooooooood
mson999999 2015-11-20 23:37
thanks for sharing
patrickrain333 2015-11-21 02:05
[隱藏廣告]
Nice pants
mablesoscar 2015-11-21 02:40
Thanks for yr sharing
junior2000 2015-11-21 15:10
thanks
thanks for sharing
chennansong 2015-11-22 00:35
Thanks for sharing
altezza3 2015-11-22 01:24
thank you for sharing
nijinsky1980 2015-11-22 01:40
see.............
flash00 2015-11-22 02:40
thx~~~~~~~~~~~~~~~~~~~~~~~
asd1937159 2015-11-22 04:35
:loveliness:
ken14139 2015-11-22 08:09
good good
joy22762287 2015-11-22 12:04
thanks for sharing!!
lzt2002 2015-11-22 21:21
/*
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--)
{
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]);
}
}
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[G[i][j]]++;
nout[i]++;
}
}
}
int nin0=0,nout0=0;
for(int i=1;i<=n;i++)
{
if(nin[i]==0)
{
nin0++;
}
else if(nout[i]==0)
{
nout0++;
}
}
cout<<max(nin0,nout0)<<endl;
}
return 0;
}
卍邪神卍 2015-11-23 12:12
回復 1# 的帖子
:loveeyes: :loveeyes:
godppgo2 2015-11-26 14:41
thanks for sharing!!:loveliness:
liao_marco 2015-11-27 01:29
nice nice nice
jumbo_orient 2015-11-27 01:55
Kkkkkkkkkkkkk
lamlam1234 2015-11-27 20:09
:verygood:
abccchan 2015-11-27 23:54
:lol :lol :lol :lol
chansiuki 2015-11-28 00:31
*** 作者被禁止或刪除 內容自動屏蔽 ***
Menmen7758 2015-11-28 18:21
thanks for sharing
mikechan1218 2015-11-28 23:20
thanks for share
c_sa3000 2015-11-28 23:59
Thx for sharing