Invitation to Codenight v1 2020

Hello CodeChef community!

Hack36 2020 and Computer Club, MNNIT Allahabad, India are glad to invite you to the first edition of a new programming competition of MNNIT Allahabad, CODENIGHT v1, which is an ACM-ICPC style team programming contest of 2 hours duration to be held on CodeChef during its annual hackathon event Hack36. A team can consist of up to 4 members.

Contest Details:

Top 3 global teams will get 300 CodeChef laddus each and few top Indian teams get direct entry to Hack36 to be held at MNNIT Allahabad.

The problem setting panel includes Aayush Chauhan, Ayush Gupta, Sri Ram Khandelwal and Priyanshu Singh.

We have an exciting problemset awaiting for you. Good luck and have fun!

1 Like

Bump! The contest begins in less than 2 hours!

What is the expected complexity of “A Not-so-easy Task”?

\mathcal{O}(\log S)

Can u explain how to solve it .

How to solve tree query question , I am getting TLE
Link to code :-

Yes, right. I overlook the property that A_i > (A_0+A_1+....+ A_{i-1}), so greedy will work here. I thought it was meet in the middle, unfortunately that was TLE.

Problems were great. Can you please provide editorials for the problems ?

@rutvik28 can you please tell how you solved problem FPAIRS , I didn’t get the intuition of the problem ?

Please upload the tutorial.

Look at imo shortlist 2013 n7
The link