# POJ1975总结

## Median Weight Bead

### Description

There are N beads which of the same shape and size, but with different weights. N is an odd number and the beads are labeled as 1, 2, …, N. Your task is to find the bead whose weight is median (the ((N+1)/2)th among all beads). The following comparison has been performed on some pairs of beads:
A scale is given to compare the weights of beads. We can determine which one is heavier than the other between two beads. As the result, we now know that some beads are heavier than others. We are going to remove some beads which cannot have the medium weight.

For example, the following results show which bead is heavier after M comparisons where M=4 and N=5.

```1.	Bead 2 is heavier than Bead 1.
2.	Bead 4 is heavier than Bead 3.
3.	Bead 5 is heavier than Bead 1.
4.	Bead 4 is heavier than Bead 2.```

From the above results, though we cannot determine exactly which is the median bead, we know that Bead 1 and Bead 4 can never have the median weight: Beads 2, 4, 5 are heavier than Bead 1, and Beads 1, 2, 3 are lighter than Bead 4. Therefore, we can remove these two beads.

Write a program to count the number of beads which cannot have the median weight.

### Input

The first line of the input file contains a single integer t (1 <= t <= 11), the number of test cases, followed by the input data for each test case. The input for each test case will be as follows:
The first line of input data contains an integer N (1 <= N <= 99) denoting the number of beads, and M denoting the number of pairs of beads compared. In each of the next M lines, two numbers are given where the first bead is heavier than the second bead.

### Output

There should be one line per test case. Print the number of beads which can never have the medium weight.

```1
5 4
2 1
4 3
5 1
4 2
```

`2`

### 我的代码

``````#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;

int t,n,m,a,b;
int map;
int flag;

void dfs(int now)
{
flag[now]=2;
for (int i=1;i<=n;i++)
{
if (map[now][i]==1)
{
if (flag[i]==2)
{
for (int j=1;j<=n;j++)
{
map[now][j]+=map[i][j];
}
}
else if (flag[i]==1)
{
dfs(i);
for (int j=1;j<=n;j++)
{
map[now][j]+=map[i][j];
}
}
}
}
}

int main()
{

scanf("%d",&t);
while(t--)
{
int ans=0,num;
scanf("%d%d",&n,&m);
num=(n+1)/2;
memset(map,0,sizeof(map));
memset(flag,0,sizeof(flag));
while (m--)
{
scanf("%d%d",&a,&b);
map[a][b]=1;
flag[a]=1;
}
for (int i=1;i<=n;i++)
{
if (flag[i]==1) dfs(i);
}
for (int i=1;i<=n;i++)
{
int temp=0;
for (int j=1;j<=n;j++)
{
if (map[i][j]!=0) temp++;
}
if (temp>=num) ans++;
}
for (int i=1;i<=n;i++)
{
int temp=0;
for (int j=1;j<=n;j++)
{
if (map[j][i]!=0) temp++;
}
if (temp>=num) ans++;
}
printf("%d\n",ans);
}
return 0;
}``````