HDU 2767:Proving Equivalences【强连通】
来源:互联网 发布:mac用什么浏览器比较好 编辑:程序博客网 时间:2024/05/16 09:09
Proving Equivalences
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4437 Accepted Submission(s): 1566
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?
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.
* 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.
* 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
24 03 21 21 3
Sample Output
42
注意当重复出现一条边时。。。缩点那里不能清零,会导致混乱WA。。。
AC—code:
#include<cstdio>#include<vector>#include<stack>#include<cstring>#define min(a,b) a>b?b:a#define INF 0x3f3f3f#define MAXN 20005#define MAXM 50005using namespace std;int low[MAXN],dfn[MAXN],eagenum,instack[MAXN],sccno[MAXN],scc_cnt,dfs_clock;vector<int>scc[MAXN];int head[MAXM];stack<int>s;struct Eage{int from,to,next;}eage[MAXM];void add(int a,int b){eage[eagenum].from=a;eage[eagenum].to=b;eage[eagenum].next=head[a];head[a]=eagenum++;}void tarjan(int u){int v;dfn[u]=low[u]=++dfs_clock;s.push(u);instack[u]=1;for(int i=head[u];i!=-1;i=eage[i].next){v=eage[i].to;if(!dfn[v]){tarjan(v);low[u]=min(low[u],low[v]);}else if(instack[v])low[u]=min(low[u],dfn[v]);}if(low[u]==dfn[u]){scc_cnt++;scc[scc_cnt].clear();while(1){v=s.top();s.pop();instack[v]=0;sccno[v]=scc_cnt;scc[scc_cnt].push_back(v);if(u==v)break;}}}vector<int>G[MAXN];int out[MAXN],in[MAXN];void suodian(){int i;for(i=1;i<=scc_cnt;i++){G[i].clear();out[i]=in[i]=0;}for(i=0;i<eagenum;i++){int u=sccno[eage[i].from];int v=sccno[eage[i].to];if(v!=u)G[u].push_back(v),out[u]++,in[v]++;}}int main(){int t,n,m,a,b,i;scanf("%d",&t);while(t--){while(!s.empty())s.pop();scanf("%d%d",&n,&m);eagenum=0;memset(head,-1,sizeof(head));while(m--){scanf("%d%d",&a,&b);add(a,b);}memset(dfn,0,sizeof(dfn));memset(low,0,sizeof(low));memset(sccno,0,sizeof(sccno));memset(instack,0,sizeof(instack));dfs_clock=scc_cnt=0;for(i=1;i<=n;i++)if(!dfn[i])tarjan(i);if(scc_cnt==1){printf("0\n");continue;}suodian();a=b=0;for(i=1;i<=scc_cnt;i++){if(!out[i])a++;if(!in[i])b++;}int ans=a>b?a:b;printf("%d\n",ans);}return 0;}
0 0
- hdu 2767 Proving Equivalences(强连通分量)
- hdu 2767 Proving Equivalences 强连通
- HDU 2767 Proving Equivalences 强连通
- HDU 2767 Proving Equivalences(强连通分量)
- HDU 2767:Proving Equivalences【强连通】
- HDU 2767 Proving Equivalences(强连通分量)
- HDU 2767Proving Equivalences 强连通分量
- HDU 2767 Proving Equivalences && HDU 3836 Equivalent Sets 强连通
- hdu 2767 Proving Equivalences 等价性证明 强连通分量
- hdu 2767 Proving Equivalences 强连通 缩点 求度
- HDU 2767 Proving Equivalences(强连通 Tarjan+缩点)
- HDU 2767 Proving Equivalences(强连通分量)
- hdu 2767Proving Equivalences(强连通分量压缩 )
- HDU 2767 Proving Equivalences(强连通分量)
- HDU-2767 Proving Equivalences (强连通分量[Tarjan])
- HDU 2767 Proving Equivalences 增加最小边使图为强连通
- hdu 2767 Proving Equivalences【强连通Kosaraju+缩点染色】
- hdu 2767 Proving Equivalences(强连通分量+缩点)
- 关于建立远程连接HttpRequest 遇到的问题
- spring AOP(动态代理)解析
- Range Sum Query 2D - Immutable
- 写给自己------21次的坚持
- Bug猜想(二)
- HDU 2767:Proving Equivalences【强连通】
- UIApplication详解
- Java动态代理详解
- UIVIew详解
- 十进制中正整数N中1的个数
- c语言之多级指针理解二
- fedora22下hadoop1.2.1wordcount测试
- IOS小型计算器实例代码2
- IQtoQN