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 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 158 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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 ..