Runtime Error with Exit code is 2147483647. What does it mean ? - Codeforces

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
33:20:06
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

→ Top contributors

#	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	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

View all →

→ Find user

→ Recent actions

Detailed →

death_bringer's blog

Runtime Error with Exit code is 2147483647. What does it mean ?

By death_bringer, history, 3 years ago, In English

In English

Hi, codeforces, Getting straight to the point my submission 143634261 failed at system testing and gave me a runtime error at test case 14. I tried searching about it but the only useful resource I was able to find is this blog but my code can't go beyond the limit and can't go negative. So, please help me.

Tags

help, system test, problem

-8

death_bringer
3 years ago
7

Comments

Comments (4)

Show archived | Write comment?

»

3 years ago, # |

Vote: I like it

0

Vote: I do not like it

Your comparator is fishy:

bool cmp(pair<int,int> a,pair<int,int> b){
    if(a.first==b.first){
        return a.second>b.first;
    }
    return a.first<b.first;
}

If a = {1, 2} and b = {1, 2}, then both cmp(a, b) and cmp(b, a) return true.

→ Reply

»

»

3 years ago, # ^ |

← Rev. 2 →

Vote: I like it

0

Vote: I do not like it

Thanks for helping.

Just a doubt: Shouldn't this will only cause a and b to switch their position whenever they are compared. It should not throw an error for this (speaking from my knowledge about the sort function).

Edit: I checked by removing it and the code worked but I still don't get why it is throwing that error.

→ Reply

»

»

»

3 years ago, # ^ |

Vote: I like it

+5

Vote: I do not like it

Having a bad comparator is undefined behaviour, so it may fail in various ways depending on the sort function implementation. See https://codeforces.net/blog/entry/72525 and https://stackoverflow.com/questions/45929474/why-must-stdsort-compare-function-return-false-when-arguments-are-equal

It's a rather common pitfall. Even though in some cases people get an AC verdict despite a broken comparator and don't have any reason to learn anything.

→ Reply

»

»

»

3 years ago, # ^ |

← Rev. 2 →

Vote: I like it

0

Vote: I do not like it

the comparator must follow these 3 rules: 1. For all x, comp(x,x) is false. 2. For all x and y, if comp(x,y) is true, comp(y,x) is false. 3. For all x, y, and z, if comp(x,y) and comp(y,z) are both true, comp(x,z) must be true.

→ Reply