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 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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 ..