BestCoder #Round92 B Count the Sheep

Count the Sheep

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 572    Accepted Submission(s): 247

Problem Description

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

  
  

   
   3
2 2 4
1 1
1 2
2 1
2 2
3 1 3
1 1
2 1
3 1
3 3 3
1 1
2 1
2 2
  
  

 

Sample Output

  
  

   
   8
0
2
  
  

 

题意是给一副二分图，问说总共有多少条，边数为3的增广路。

由于边数k的数据范围是1e5，一开始想用暴力枚举大概复杂度是k^(1.5)，后来大神指点看成是普通图然后直接枚举边，然后每条边的两个点的（度数-1）相乘加起来就是答案了。

#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<time.h>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<iostream>
using namespace std;
#define  LONG long long
const int   INF=0x3f3f3f3f;
const int MOD=1e9+7;
const double PI=acos(-1.0);
#define clrI(x) memset(x,-1,sizeof(x))
#define clr0(x) memset(x,0,sizeof x)
#define clr1(x) memset(x,INF,sizeof x)
#define clr2(x) memset(x,-INF,sizeof x)
#define EPS 1e-10
struct Edge
{
    int to ,next,id ,u ;
}edge[200100];
int tot = 0;
int take[200100];
void Init()
{
    clr0(take);
    tot = 0;
}
void add_edge(int u , int v)
{
    edge[++tot].to = v;
    edge[tot].u = u;
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        Init();
        int n , m , k;
        scanf("%d%d%d",&n,&m,&k);
        int u ,v ;
        for(int i = 1; i <= k ; ++ i)
        {
            scanf("%d%d",&u,&v);
            v += n;
            add_edge( u , v ) ;
            take[u ]++ ;
            take[v] ++ ;
        }
        LONG ans = 0;
        for(int i =1 ; i <= tot ;++ i)
        {
            int x = edge[i].u ;
            int y = edge[i].to ;
            ans += (LONG )(take[x] -1)*(take[y] - 1);
        }
        printf("%lld\n",ans*2 ) ;
    }
}