codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

978F.md (2418B)


      1 Source: https://codeforces.com/problemset/problem/978/F
      2 
      3 F. Mentors
      4 
      5 time limit per test
      6 
      7 3 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 In BerSoft $n$ programmers work, the programmer $i$ is characterized by a skill $r_i$.
     22 
     23 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 \gt r_b)$ and programmers $a$ and $b$ are not in a quarrel.
     24 
     25 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.
     26 
     27 Input
     28 
     29 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.
     30 
     31 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.
     32 
     33 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.
     34 
     35 Output
     36 
     37 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.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 4 2  
     45 10 4 10 15  
     46 1 2  
     47 4 3
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 0 0 1 2
     54 ```
     55 
     56 Input
     57 
     58 ```
     59 10 4  
     60 5 4 1 5 4 3 7 1 2 5  
     61 4 6  
     62 2 1  
     63 10 8  
     64 3 5
     65 ```
     66 
     67 Output
     68 
     69 ```
     70 5 4 0 5 3 3 9 0 2 5
     71 ```
     72 
     73 Note
     74 
     75 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.