Invitation to CodeChef October Long Challenge 2019

, ,
1

Greetings CodeChef community!

Did you enjoy our servings in the CodeChef’s September Lunchtime? Hopefully, you achieved an improved rating and a bunch of mouthwatering ACs.

Now, the CodeChef’s October Long Challenge is just around the corner. We urge everyone from our community to take part in this contest, starting 4th October till 14th October. It will be an occasion where you put to test your exceptional programming skills.

The problem statements will be available in English, Hindi, Bengali, Russian, Mandarin and Vietnamese.

Do join your fellow programmers and actively participate in this thrilling contest! Accompanying me on the problem setting panel are:

Contest Details:

Time: 4th October 2019 (1500 hrs) to 14th October 2019 (1500 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Contest link: https://www.codechef.com/OCT19

Registration: You just need to have a CodeChef handle to participate. For all those who are interested and do not have a CodeChef handle, are requested to register in order to participate.

Prizes: Top 20 performers in Indian category and top 10 performers in Global category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. First to solve each problem except challenge - 100 laddus. Know more here: https://goodies.codechef.com/.

(For those who have not yet got their previous winning, please send an email to winners@codechef.com)

Good Luck! Hope to see you participating! Happy Programming!

13 Likes
2

Looking forward to the contest. :grinning:

1 Like
3

Excitated but sessionals are coming.:grin::sweat_smile:

1 Like
4

Let this game begin :fire:

3 Likes
5

Hope this Challenge won’t be same as September Long Challenge, full of maths. :neutral_face::raised_hands:

7 Likes
6

However it maybe, we’ll do it this time :heart_eyes:

1 Like
7

Karan be like : swagat kro hamara :crazy_face::rofl::rofl:

2 Likes
8

Nothing like that. I am just so excited!

9

HOPE FOR NO MUCH MATHS THIS TIME

4 Likes
10

I think there’s a problem with the constraints of TANDON, normally a problem accepts a solution which runs in time which is a small multiple of the minimum (expected) time. My solution seems efficient and takes about 2-3 secs in worst case (even with all optimization hacks). Please verify if the time limit is 1 sec or 3 secs.

1 Like
11

Nevermind, I solved it :sweat_smile:

2 Likes
13

In problem Bacterial Reproduction, I got a different verdict for the exact same solution when resubmitted it. Can anyone explain to me how it happened and can admin look into it as the only test case failed due to TLE in one solution got accepted for the same solution when I resubmitted the same code.
Links to submissions: Submission 1
Submission 2

1 Like
14

JIIT’s time limit is real strict, but most likely because I decided to pursue Cayley instead of going to a combinatorics solution instead.

1 Like
15

@just1star
Can you please tell your solution idea ? As soon as I saw JIIT, mind went blank…no approach comes to mind even for 10 pts… :slight_smile:

17

bhai any try for last one??

1 Like
19

I saw the solution which do it in 0.06 sec…

check this

3 Likes
20

I also had a hard time optimizing the last 10. Firstly I reduced every polynomial into half which helped me get to 90, however after that I have to use polynomial division and a few minor optimizations to the N ^ 2 operations for the full 100.

Also that 0.06s use combinatorics and I did say I probably would have had an easier time if I went in that direction instead :frowning:

1 Like
21

How did you guys approached JIIT, I wasn’t able to think of any optimal solution for it. I haven’t studied many topics so bummer there but it’d be very helpful if someone can share his approach

22

Initially I was also trying using GFs and NTT. With those I was only getting 90 points Then I thought of some other solutions and managed to think of a inclusion-exclusion one.

1 Like
23

can u tell me how u created GFs… im thinking in the same way but unable to make GFs thats satisfied the solution… maybe i need more practice to make GFs…:sweat_smile: