【HDU - 6016】Count the Sheep （思维，类似二分图）

题干：

Altough Skipping the class is happy, the new term still can drive luras anxious which is of course because of the tests! Luras became worried as she wanted to skip the class, as well as to attend the BestCoder and also to prepare for tests at the same time.

However, As the result of preparing for tests, luras had no time to practice programing. She didn't want to lose her rating after attending BC. In the end, she found BCround92's writer snowy_smile for help, asking him to leak her something.

Snowy_smile wanted to help while not leaking the problems. He told luras, the best thing to do is to take a good rest according to the following instructions first.

"Imagine you are on the endless grassland where there are a group of sheep. And n sheep of them are silent boy-sheep while m sheep are crying girl-sheep. And there are k friend-relationships between the boy-sheep and girl-sheep.Now You can start from any sheep, keep counting along the friend relationship. If you can count 4 different sheep, you will exceed 99% sheep-counters and fall asleep."

Hearing of the strange instructions, luras got very shocked. Still, she kept counting. Sure enough, she fell asleep after counting 4 different sheep immediately. And, she overslept and missed the BestCoder in the next day. At a result, she made it that not losing her rating in the BCround92!!!

However, you don't have the same good luck as her. Since you have seen the 2nd problem, you are possible to have submitted the 1st problem and you can't go back.

So, you have got into an awkward position. If you don't AC this problem, your rating might fall down.

You question is here, please, can you tell that how many different 4-sheep-counting way luras might have before her sleep?

In another word, you need to print the number of the "A-B-C-D" sequence, where A-B, B-C, C-D are friends and A,B,C,D are different.

Input

The first line is an integer T which indicates the case number.

and as for each case, there are 3 integers in the first line which indicate boy-sheep-number, girl-sheep-number and friend-realationship-number respectively.

Then there are k lines with 2 integers x and y in each line, which means the x-th boy-sheep and the y-th girl-sheep are friends.

It is guaranteed that——

There will not be multiple same relationships.

1 <= T <= 1000

for 30% cases, 1 <= n, m, k <= 100

for 99% cases, 1 <= n, m, k <= 1000

for 100% cases, 1 <= n, m, k <= 100000

Output

As for each case, you need to output a single line.

there should be 1 integer in the line which represents the number of the counting way of 4-sheep-sequence before luras's sleep.

Sample Input

Sample Output

8
0
2

题目大意：

有一堆公羊和母羊，给定K个关系（一定是公羊和母羊的关系），让你找出从里面任意一头开始找。找到四头不同的羊。为你一共有多少种找法。（1 <= n, m, k <= 100000）

解题报告：

给出很多对雄羊雌羊的朋友关系，让你数数，能数出几种关系，关系中的四只羊不能有重复的。相当于四只羊中间有三条边，遍历中间那条边即可，最后答案再乘2，因为反过来也是成立的。

AC代码

#include<cstdio>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int MAX = 100000 +5;
struct Edge {int u,v;Edge(){}Edge(int u,int v):u(u),v(v){}
} e[MAX];
ll mile[MAX],femile[MAX];
int top;
int main()
{int t;int n,m,k,a,b;cin>>t;while(t--) {top = 0;memset(mile,0,sizeof mile);memset(femile,0,sizeof femile);scanf("%d%d%d",&n,&m,&k);for(int i = 1; i<=k; i++) {scanf("%d%d",&a,&b);e[++top] = Edge(a,b);mile[a]++;femile[b]++;}ll ans = 0;for(int i = 1; i<=top; i++) {ans += (mile[e[i].u]-1) * (femile[e[i].v] - 1);}printf("%lld\n",ans*2);}return 0 ;
}

【HDU - 6016】Count the Sheep （思维，类似二分图）相关推荐

HDU - 6016 Count the Sheep(二分图+思维)
题目链接:点击查看题目大意:给出左右两个子集分别,再给出k条边,问能否找出四个点,让其连成一条路径题目分析:一开始看到这个题肯定是个二分图,又因为有边,我就往度数上面想,一看四个点,就在想能不能枚 ...
hdu 6016 Count the Sheep
BestCoder Round #92 B题 (今天突然想起来这道题在做的时候卡了cin 而且似乎也有爆int的坑就拿出来记录一下 ((这道题能用来测试输入输出外挂的性能中文题意不解释比赛的时候 ...
HDU 3729 I'm Telling the Truth(二分图最大匹配)
HDU 3729 I'm Telling the Truth(二分图最大匹配) http://acm.hdu.edu.cn/showproblem.php?pid=3729 题意: 一位老师想问N位同 ...
HDU 2389 Rain on your Parade （二分图匹配）
题意:天马上就要下雨了,然后有n个人,m把伞,然后分别给出人的坐标和他们跑的速度,以及伞的坐标,然后问在t时间内,最多能有多少人拿到伞. 题解:二分图匹配之前做过一道类似的题目,是用最大流做的,但这 ...
HDU 6092 Rikka with Subset 思维递推
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=6092 题目描述: 给你一个集合的所有子集各个和, 让你找到这个集合, 输出字典序最小解题思路: 下 ...
HDU 3336 Count the string（KMP+DP）
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3336 题意:给你一个字符串,计算其所有前缀在该字符串出现的次数的总和. 思路:next[j]=i,代表 ...
HDU 3336 Count the string KMP
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=3336 如果你是ACMer,那么请点击看下题意:求每一个的前缀在母串中出现次数的总和. AC代码: # ...
HDU 4588 Count The Carries 数学
Count The Carries Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu.cn/vjudge/contest ...
HDU - 1151 Air Raid(最小路径覆盖-二分图最大匹配)
题目链接:点击查看题目大意:给出一个有向图,现在需要在不同的地方空降伞兵,保证所有伞兵沿着道路可以走完所有城市,求出最少伞兵的数量题目分析:我们的目的是要用最少的路径覆盖所有顶点,换句话说就是二分 ...

【HDU - 6016】Count the Sheep （思维，类似二分图）

【HDU - 6016】Count the Sheep （思维，类似二分图）相关推荐

最新文章

热门文章