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

BUG反馈门

F. Mentors
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

In BerSoft nn programmers work, the programmer ii is characterized by a skill riri.

A programmer aa can be a mentor of a programmer bb if and only if the skill of the programmer aa is strictly greater than the skill of the programmer bb (ra>rb)(ra>rb) and programmers aa and bb are not in a quarrel.

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

Input

The first line contains two integers nn and kk (2n2105(2≤n≤2⋅1050kmin(2105,n(n1)2))0≤k≤min(2⋅105,n⋅(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 r1,r2,,rnr1,r2,…,rn (1ri109)(1≤ri≤109), where riri equals to the skill of the ii-th programmer.

Each of the following kk lines contains two distinct integers xxyy (1x,yn(1≤x,y≤nxy)x≠y) — pair of programmers in a quarrel. The pairs are unordered, it means that if xx is in a quarrel with yy then yy is in a quarrel with xx. Guaranteed, that for each pair (x,y)(x,y) there are no other pairs (x,y)(x,y) and (y,x)(y,x) in the input.

Output

Print nn integers, the ii-th number should be equal to the number of programmers, for which the ii-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.

/**

*/

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxn=2e5+7;
int a[maxn],b[maxn],ans[maxn],l,r;

int main (){
int n,m;scanf("%d %d",&n,&m);
memset(ans,0,(n+3)*sizeof(int));
for(int i=0;i<n;i++) scanf("%d",&a[i]),b[i]=a[i];
for(int i=0;i<m;i++){
scanf("%d %d",&l,&r);l--,r--;
if(a[l]>a[r]) ans[l]--;
else if(a[l]<a[r]) ans[r]--;
}
sort(b,b+n);
for(int i=0;i<n;i++){
int res=lower_bound(b,b+n,a[i])-b;
printf("%d\n",ans[i]+res);
}
return 0;
}

• 评论

• 下一篇
• 上一篇