How to solve it with Disjoint Data Structure .
thanks .
UPDATE : any help , i can't get the idea.
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | AmShZ | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 134 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
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 |
|---|


