Guys i am stuck in this problem-http://www.spoj.com/problems/RATING/.Any help will be appreciated .
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 15:26:45 (k1).
Desktop version, switch to mobile version.
Supported by
this problem requires the knowledge of data structure such as segment tree or fenwick tree.
sort according to the values of any rating (open or school ratings — i have considered open ratings in my explanation)
(think yourself why we need sorting ?)
query for no of hashes less than equal to corresponding high school ratings — name it res
for every coder sharing same value of open and high school ratings, assign them res (justify yourself why ?) and update the tree with his high school rating.
UPD : I found one good explanation from codechef discussion page.
here
here