How to solve it with Disjoint Data Structure .
thanks .
UPDATE : any help , i can't get the idea.
# | 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 |
# | 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 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
How to solve it with Disjoint Data Structure .
thanks .
UPDATE : any help , i can't get the idea.
HI All , problem from a contest hosted by my university .
here it is (http://a2oj.com/p.jsp?ID=282) .
any idea how to solve it .
thanks .
Codeforces Round #262 (Div. 2) :
all these new accounts just registered in codeforces before 29 hour ago except "Memset137" :
maybe i am wrong but it is obvious that they are Div1 participants depending on what they solve !! now if we eliminate these participants we will get the TRUE standing .
1 — buptcjj
2 — ladpro98
3 — linjek
5 — rureggaeton
6 — win_ay39
7 — kalimm
why they do this ?!! they can participate even if they are Div1 !
Name |
---|