How to solve it with Disjoint Data Structure .
thanks .
UPDATE : any help , i can't get the idea.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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 |
---|