CodeChef Break-The-Server

announcement
27

How can we break something which is already broken ??? :man_shrugging:t2:

28

:laughing:

29

Codechef : kaisa lage mera majak

2 Likes
30

Server is already Broken :frowning:

31

They are visible now lol

32

problem is not visible ?? it’s again server issue!!!

33

I can’t even view the problems! What’s happening @admin

34

Completely Waste of scheduling my time. :rofl: :rofl:

35

Now Its Visible

36

Well I submitted a solution with a 10^10 loop and it still gave me a correct answer. Here is my code ACQOdk - Online C++ Compiler & Debugging Tool - Ideone.com .
I am wondering is this some kind of compiler optimisation because even ideone compiles it within a sec but I get a segmentation fault in my local system.

38

Contest over. It was really nice. One doubt: Was the last problem suitable for Div3?

39

Yes I think it was just a trivial binary lifting, wasn’t it ?

40

The time limit for this was 20 seconds, what’s so strange about it?

41

How did you solve E , wasnt it meant to be solved using LCA?

42

Nice contest, but only 1961 people participated as compared to 10,985 in January Lunchtime.

2 Likes
43

yeah it was, prefix sums+ lca

1 Like
44

image
image836×238 29.1 KB

why push this notification multiple times , ek baar bola to no thanks …so annoying.

@admin

2 Likes
45

I did the same and got TLE.
can you look into this code once and tell the reason for TLE.

47

I think 1-4 were very easy and (just an opinion) suddenly 5 was hard. It was lowest common ancestor, which is hard to implement…

48

I think using endl instead of “\n” is screwing up the things. They specifically mentioned to use fast IO

1 Like