# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Name |
---|
I guess the problem is array
jaroori
which has size up toN
in your solution, but it's clearly contains some info about edges, so should be up toM
(orN * N
asfrom
andto
)Thanks for pointing it out ! i believe it should give me segmentation fault rather than MLE !
Well, technically it's undefined behavior, so anything could happen =)
Also if you enable some compiler options (like address sanitzer) it should catch this kind of issue. Check this post http://codeforces.net/blog/entry/15547. It could help to catch this kind of bugs locally (if you actually do proper testing locally, if not then start doing ;)).
If you want to understand what exactly going on in your case you can take a look at disassembly: https://godbolt.org/g/sYE6qJ
So it seems that layout for data is
jaroori
and thenparent
. So potentially what could happen that you will override some of theparent
's value and create a loop, e.g.parent[0] = 1
,parent[1] = 0
and then you'll have unbounded recursion. Stack size limit for G++ is 256MB (according to http://codeforces.net/blog/entry/79).So you have some memory allocated besides that + you probably almost hit stack size limit and got MLE before you've got RTE due to stack overflow.
Could be something else, but you can investigate further on your own.