I'm trying to solve a problem using Union Find, for storing Connected Components of a graph, and a Multiset for ordering the Components' Weights ... but i'm getting "SIGSECV ( Abort Called ) "... here is my code Link
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I'm trying to solve a problem using Union Find, for storing Connected Components of a graph, and a Multiset for ordering the Components' Weights ... but i'm getting "SIGSECV ( Abort Called ) "... here is my code Link
Name |
---|
Line 18 should be
Father[f1] = Father[f2];
.The reason you get a runtime error is as follows: Let's say
f1
is different froma
. Since you only change the parent pointer ofa
, the parent pointer off1
still points tof1
. However, the weight off1
is removed from the multiset. So if you call the merge function again withf1
, the program will try to eraseWeight[f1]
from the multiset. If the weight is no longer present though,Order.find(Weight[f1])
returnsOrder.end()
, and callingerase
on that produces a runtime error.this was from ongoing contest : https://www.hackerrank.com/contests/morgan-stanley-2015/leaderboard ..