HDU2767 Proving Equivalences

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5742    Accepted Submission(s): 1973

Problem Description

Consider the following exercise, found in a generic linear algebra textbook.

Let A be an n × n matrix. Prove that the following statements are equivalent:

1. A is invertible.
2. Ax = b has exactly one solution for every n × 1 matrix b.
3. Ax = b is consistent for every n × 1 matrix b.
4. Ax = 0 has only the trivial solution x = 0.

The
typical way to solve such an exercise is to show a series of
implications. For instance, one can proceed by showing that (a) implies
(b), that (b) implies (c), that (c) implies (d), and finally that (d)
implies (a). These four implications show that the four statements are
equivalent.

Another way would be to show that (a) is equivalent
to (b) (by proving that (a) implies (b) and that (b) implies (a)), that
(b) is equivalent to (c), and that (c) is equivalent to (d). However,
this way requires proving six implications, which is clearly a lot more
work than just proving four implications!

I have been given some
similar tasks, and have already started proving some implications. Now I
wonder, how many more implications do I have to prove? Can you help me
determine this?

 

Input

On the first line one positive number: the number of testcases, at most 100. After that per testcase:

* One line containing two integers n (1 ≤ n ≤ 20000) and m (0 ≤ m ≤
50000): the number of statements and the number of implications that
have already been proved.
* m lines with two integers s1 and s2
(1 ≤ s1, s2 ≤ n and s1 ≠ s2) each, indicating that it has been proved
that statement s1 implies statement s2.

 

Output

Per testcase:

* One line with the minimum number of additional implications that
need to be proved in order to prove that all statements are equivalent.

 

Sample Input

2
4 0
3 2
1 2
1 3

 

Sample Output

4
2

 

Source

NWERC 2008

 

Recommend

lcy

 

理解一下题意，经过奇奇怪怪的转化以后，得出核心题意：给一个有向图，问最少加几条边可使其成为强连通图。

tarjan缩点以后，统计入度为0和出度为0的点个数，取最大值就是答案。

 

这题总感觉以前做过好多次？

 

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<vector>
 #include<cstring>
 using namespace std;
 const int mxn=;
 int top,stack[mxn];
 bool inst[mxn];
 int cnt,dnow;
 int dfn[mxn],low[mxn];
 int belone[mxn],in[mxn],out[mxn];
 vector<int> e[mxn];
 void clear(){
     cnt=;dnow=;top=;
     memset(dfn,-,sizeof(dfn));
     memset(inst,false,sizeof(inst));
     memset(in,,sizeof in);
     memset(out,,sizeof out);
     for(int i=;i<mxn;i++) e[i].clear();
 }
 int n,m;
 void tarjan(int s){
     int v=,i;
     dfn[s]=++dnow;
     low[s]=dfn[s];
     inst[s]=true;
     stack[++top]=s;
     int si=e[s].size();
     for(i=;i<si;i++){
         v=e[s][i];
         if(dfn[v]==-){
             tarjan(v);
             low[s]=min(low[v],low[s]);
         }
         else if(inst[v]){
             low[s]=min(dfn[v],low[s]);
         }
     }
     if(dfn[s]==low[s]){
         cnt++;
         do{
             v=stack[top--];
             belone[v]=cnt;
             inst[v]=false;
         }while(s!=v);
     }
     return;
 }
 void calc(){
     if(cnt==){
         printf("0\n");return;
     }
     int i,j;
     for(i=;i<=n;i++){
         for(j=;j<e[i].size();j++){
             int v=e[i][j];
             if(belone[i]!=belone[v]){
                 in[belone[v]]++;
                 out[belone[i]]++;
             }
         }
     }
     int idg=,odg=;
     for(i=;i<=cnt;i++){
         if(!in[i])idg++;
         if(!out[i])odg++;
     }
     printf("%d\n",max(idg,odg));
     return;
 }
 int main(){
     int T;
     scanf("%d",&T);
     while(T--){
         scanf("%d%d",&n,&m);
         if(!m){
             if(n==)printf("0\n");
             else printf("%d\n",n);
             continue;
         }
         clear();
         int i,j;
         int u,v;
         for(i=;i<=m;i++){
             scanf("%d%d",&u,&v);
             e[u].push_back(v);
         }
         for(i=;i<=n;i++){
             if(dfn[i]==-)tarjan(i);
         }
         calc();
     }
     return ;
 }