-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathUVA_11504.cpp
80 lines (78 loc) · 1.83 KB
/
UVA_11504.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<bits/stdc++.h>
using namespace std;
#define fastread ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fileRead freopen("input.txt","r",stdin);
#define fileWrite freopen("output.txt","w",stdout);
#define pb push_back
#define mp make_pair
#define white 0
#define grey 1
#define black 2
vector<int>adj_node[100001];
int visited[100001]={0};
int discovering_time[100001]={0};
int finishing_time[100001]={0};
int timing = 0;
void dfs_visit(int u)
{
visited[u]=grey;
int len = adj_node[u].size();
discovering_time[u]=++timing;
for(int i=0;i<len;i++)
{
if(visited[adj_node[u][i]]==white)
{
dfs_visit(adj_node[u][i]);
}
}
visited[u]=black;
finishing_time[u]=++timing;
}
int main()
{
//fileRead
//fileWrite
fastread
int test;
cin>>test;
while(test--)
{
timing=0;
int n,m;
cin>>n>>m;
map<int,int>ii_map;
while(m--)
{
int node1,node2;
cin>>node1>>node2;
adj_node[node1].pb(node2);
}
memset(visited,0,sizeof visited);
for(int i=1;i<=n;i++)
{
if(visited[i]==white)
{
dfs_visit(i);
}
}
vector<pair<int,int> >vec;
for(int i=1;i<=n;i++)
vec.pb(mp(-finishing_time[i],i));
sort(vec.begin(),vec.end());
memset(visited,0,sizeof visited);
memset(discovering_time,0,sizeof discovering_time);
memset(finishing_time,0,sizeof finishing_time);
int cnt = 0;
for(int i=0;i<n;i++)
{
if(visited[vec[i].second]==white)
{
dfs_visit(vec[i].second);
cnt++;
}
}
cout<<cnt<<endl;
for(int i=1;i<=n;i++)
adj_node[i].clear();
}
}