| Title |
User |
Message |
Place |
Date Posted |
| Re: WA on WCIPEG, but not on DMOJ |
SpeedCrypt6119k |
Thank you very much. |
ccc08j3 |
Jan 03, 2020 - 4:00:37 pm UTC |
| Re: WA on WCIPEG, but not on DMOJ |
jargon |
You are not initializing your variables. |
ccc08j3 |
Jan 03, 2020 - 3:24:23 am UTC |
| WA on WCIPEG, but not on DMOJ |
SpeedCrypt6119k |
My submission (latest) seems to not be working on this judge, but is successful on DMOJ. I would just like to know why this happened. |
ccc08j3 |
Dec 25, 2019 - 10:41:58 pm UTC |
| Test cases are weak? |
ainta |
I think many solutions will fail on this test: 5 3 3 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 |
noi13p1 |
Dec 25, 2019 - 5:31:38 pm UTC |
| Re: RTE on the last 2 test cases |
jargon |
This is covered in the help page: SIGABRT - Uncaught exception or failed assertion in C++; can also be caused by popping empty stacks ... |
ioi0323 |
Dec 10, 2019 - 10:21:03 pm UTC |
| RTE on the last 2 test cases |
dolphingarlic |
Does anyone have any idea why I'm getting RE (signal 6: SIGABRT) on the last 2 test cases? I don't think my code is accessing anything out of bounds |
ioi0323 |
Dec 10, 2019 - 4:36:25 pm UTC |
| Explanations |
LucianIlea |
This problem has a quite unclear content. What we are supposed to do is to check whether a given directed graph (before 0 0 its edges are listed) is a rooted tree or not. Its vertices are not necessar... |
wc99p6 |
Dec 08, 2019 - 7:51:06 am UTC |
| Re: what's wrong with my code??? |
jargon |
Do not post code. Read through the rest of the comments; your issue has been encountered before. |
ccc02j2 |
Dec 05, 2019 - 6:34:05 am UTC |
| Re: Help |
jargon |
I promise you that your latest submission does not. Look more carefully. |
ccc07j2 |
Dec 05, 2019 - 6:32:32 am UTC |
| what's wrong with my code??? |
kiki |
[snip] |
ccc02j2 |
Dec 04, 2019 - 8:25:06 am UTC |
