How to solve it with Disjoint Data Structure .
thanks .
UPDATE : any help , i can't get the idea.
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
2 | adamant | 163 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 147 |
7 | atcoder_official | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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 |
---|