Codeforces Round #481 (Div. 3) F. Mentors

F. Mentors

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In BerSoft $n$ programmers work, the programmer $i$ is characterized by a skill $r_i$.

A programmer $a$ can be a mentor of a programmer $b$ if and only if the skill of the programmer $a$ is strictly greater than the skill of the programmer $b$ $(r_a>r_b)$ and programmers $a$ and $b$ are not in a quarrel.

You are given the skills of each programmers and a list of $k$ pairs of the programmers, which are in a quarrel (pairs are unordered). For each programmer $i$, find the number of programmers, for which the programmer $i$ can be a mentor.

Input

The first line contains two integers $n$ and $k$ $(2\le n\le 2\cdot {10}^5$, $0\le k\le min(2\cdot {10}^5,\frac{n\cdot (n-1)}{2}))$ — total number of programmers and number of pairs of programmers which are in a quarrel.

The second line contains a sequence of integers $r_1,r_2,\dots ,r_n$ $(1\le r_i\le {10}^9)$, where $r_i$ equals to the skill of the $i$-th programmer.

Each of the following $k$ lines contains two distinct integers $x$, $y$ $(1\le x,y\le n$, $x\ne y)$ — pair of programmers in a quarrel. The pairs are unordered, it means that if $x$ is in a quarrel with $y$ then $y$ is in a quarrel with $x$. Guaranteed, that for each pair $(x,y)$ there are no other pairs$(x,y)$ and $(y,x)$ in the input.

Output

Print $n$ integers, the $i$-th number should be equal to the number of programmers, for which the $i$-th programmer can be a mentor. Programmers are numbered in the same order that their skills are given in the input.

Examples

input

Copy

4 2
10 4 10 15
1 2
4 3

output

Copy

0 0 1 2 

input

Copy

10 4
5 4 1 5 4 3 7 1 2 5
4 6
2 1
10 8
3 5

output

Copy

5 4 0 5 3 3 9 0 2 5 

Note

In the first example, the first programmer can not be mentor of any other (because only the second programmer has a skill, lower than first programmer skill, but they are in a quarrel). The second programmer can not be mentor of any other programmer, because his skill is minimal among others. The third programmer can be a mentor of the second programmer. The fourth programmer can be a mentor of the first and of the second programmers. He can not be a mentor of the third programmer, because they are in a quarrel.

题目大意：如果一个人比另一个人的能力值高，而且这两个人不在争吵状态，则能力值较高的人可以成为另一个人的师父，求每个人能成为多少人的师父。

思路：把所有人按照能力值高低排序，然后对每个人用lower_bound找有多少人能力值比他能力值低，并用ans数组记录下来。最后读入吵架的人，如果吵架的两人能力值相等，则不会影响任何一个答案，如果能力值不相等，则能力值较高者所对应的ans值需要减一，最后附上代码：

#include <bits/stdc++.h>
int a[200005],s[200005],ans[200005];
int main()
{
    int n,k,i;
//    freopen("in.txt", "r", stdin);
    scanf("%d%d", &n, &k);
    for (i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        s[i] = a[i];
    }
    std::sort(s + 1, s + n + 1);
    for (i = 1; i <= n; i++)
    {
        int p = std::lower_bound(s + 1, s + n + 1, a[i]) - s;
        ans[i] = p - 1;
    }
    while (k--)
    {
        int k1,k2;
        scanf("%d%d", &k1, &k2);
        if (a[k1] == a[k2])
            continue;
        if (a[k1] > a[k2])
            ans[k1]--;
        else
            ans[k2]--;
    }
    printf("%d", ans[1]);
    for (i = 2; i <= n; i++)
        printf(" %d", ans[i]);
    printf("\n");
    return 0;
}