Median题目讲解

最新推荐文章于 2024-08-16 16:51:12 发布

东唯

最新推荐文章于 2024-08-16 16:51:12 发布

阅读量581

点赞数 8

文章标签： c++ 算法

本文链接：https://blog.csdn.net/2201_75641262/article/details/140600100

版权

文章目录

Median

Median

题目

Recall the definition of the median of nelements where $n$ is odd: sort these elements and the median is the $\frac{(n + 1)}{2}$ -th largest element.

In this problem, the exact value of each element is not given, but m relations between some pair of elements are given. The $i - t h$ relation can be described as $a_i,b_i)$ , which indicates that the $a_i-th$ element is strictly larger than the $b_i -th$ element.

For all 1 ≤ k ≤ n, is it possible to assign values to each element so that all the relations are satisfied and the $k - t h$ element is the median of the n elements?

输入

There are multiple test cases. The first line of the input contains an integer $T$ , indicating the number of test cases. For each test case:
The first line contains two integers $n$ and $m$ $1≤n<100, 1≤m≤n^2)$ , indicating the number of elements and the number of relations. It’s guaranteed that $n$ is odd.

For the following $m$ lines, the $i - t h$ line contains two integers $a_i$ and $b_i$ , indicating that the $ai - t h$ element is strictly larger than the $b_i -th$ element. It guaranteed that for all $1≤i<j≤m, a_i≠a_j$ or $b_i≠b_j$

It’s guaranteed that the sum of n of all test cases will not exceed $2 × 10 ^3$

输出

For each test case output one line containing one string of length n. If it is possible to assign values to each element so that all the relations are satisfied and the $i - t h$ element is the median, the $i - t h$ character of the string should be $^{'} 1^{'}$ , otherwise it should be $^{'} 0^{'}$ .

Examples

Input

Outout

01000
000

Note

For the first sample test case, as the 2nd element is smaller than the 1st and the 3rd elements and is larger than the 4th and the 5th elements, it’s possible that the 2nd element is the median.

For the second sample test case, as the 1st element can’t be larger than itself, it’s impossible to assign values to the elements so that all the relations are satisfied.

题目汉化

给你 $T$ 组测试，每组测试 $n$ 个数字 $m$ 个大小关系，接下来是 $m$ 条对应关系，前面的大于后面的，就是比如输入：3 2，意思是第3个位置大于第2个位置，题目让你找到他们的中位数（中位数就是排序后最中间的那个数字），中位数的那一位输出1，其他输出0。

做法

参考佬的做法,hh
https://blog.csdn.net/weixin_45675097/article/details/120917027
因为每个数之间都有一定的关系,比如第5位大于第4位，第4位大于第3位，那么就隐含了一组对应关系，就是第5位大于第3位
所以求得每个数字的对应关系后就很好得到了

每个数字的相应关系，很容易想到Floyd算法

用int mp[N][N]记录每个数字的对应关系，如上面的例子就是mp[5][4] = 1,意思就是5比4这个位置的数字大

 while (m--)
 {
      int l, r;
      cin >> l >> r;
      mp[l][r] = 1;
      if (l == r)
          ok = 1;
}

这个ok就是看合法不合法，不能存在一个数字比自己大吧，hh~~
然后求每个数对应每个数的关系，

//不能第5位 比 第4位 大，第4位 又比第 5位 大吧
 if (mp[i][j] && mp[j][i])
{
	ok = 1;
	break;
}
else
{
	//如果 第5位 比 第4位 大， 第4位 比第3位 大，那么就是mp[5][3] |= mp[5][4]&mp[4][3]
	//如果mp[5][3]已经是1了， 所以就是 用 或 |= ，
	
	mp[i][j] |= mp[i][k] & mp[k][j];
}

如果 ok 成立，就是不合法，直接输出结果就是n个0
合法的话，就看入度和出度，中位数的入度 din $<=$ $\frac{n}{2}$ ,出度dout也是 $<=$ $\frac{n}{2}$ ,对吧
所以遍历一遍，复合条件输出1，不然输出0

代码

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
#define endl '\n'
const int N = 2e5 + 5;
const int INF = 2e9 + 1;
typedef pair<int, int> PII;

int mp[105][105];
int din[105], dout[105];
void solve()
{
    int n, m;
    cin >> n >> m;
    bool ok = 0;
    memset(mp, 0, sizeof mp);
    while (m--)
    {
        int l, r;
        cin >> l >> r;
        mp[l][r] = 1;
        if (l == r)
            ok = 1;
    }
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (mp[i][j] && mp[j][i])
                {
                    ok = 1;
                    break;
                }
                else
                {
                    mp[i][j] |= mp[i][k] & mp[k][j];
                }

    if (ok)
    {
        for (int i = 1; i <= n; i++)
            cout << 0;
        cout << endl;
        return;
    }
    memset(din, 0, sizeof din);
    memset(dout, 0, sizeof dout);

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (i != j && mp[i][j])
            {
                din[j]++;
                dout[i]++;
            }
    for (int i = 1; i <= n; i++)
        if (din[i] <= n / 2 && dout[i] <= n / 2)
            cout << 1;
        else
            cout << 0;
    cout << endl;
}

signed main()
{
    IOS;
    int T;
    cin >> T;
    while (T--)
        solve();

    return 0;
}