In today's Codeforces Round (#763) problem B, I tried finding a pair object in a HashSet. Even after overriding equals() and hashcode() methods, I still ended up with WA on test 4. Here is the link to my solutions:
1) WA Submission using HashSet
2) Working Solution using 2D matrix
Please let me know of a good fix for this.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
Use
Integer.equalsinstead of==in yourpair.equals, otherwise you getfalsewhen comparing two objects with the same value but different references. Btw, same bug in thepair.compareTomethod.Check this AC solution: https://codeforces.me/contest/1623/submission/140959789
btw,
Integeris pretty slow compared toint. So if possible (like in this case), it is better to useint.So if I use
int, how will myhashcode()work?Like this: https://codeforces.me/contest/1623/submission/140960231
Another hint: if you use JetBrains IDEA, in most cases you can use auto-generated equals and hashCode methods. It is just a couple of clicks: https://www.jetbrains.com/help/idea/generating-code.html#generate-equals-hashcode
I don't get how the 13*x + y is working can you please explain.
Does this mean that a pair — 5, 14 and a pair 6, 1 will have the same hashcode inside the hashset?
Yeah, two unrelated pairs could have the same hashcode. This is why you also need to override equals(), because two things with the same hash might have different values.