Hi,

I want to invite you to the annual programming competition of MNNIT Allahabad, India, which is an ACM-ICPC style team programming contest of 3 hours duration.

Prizes

Members of top 2 teams will win Codechef goodies.

Contest details

Contest timings: Check here

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

Problem setters:

INSQ15_A : codefor6768, INSQ15_B: kunal_rocks, INSQ15_C: dead_shooter, INSQ15_D: mgajabi, INSQ15_E: amanmittal, INSQ15_F: vishfrnds, INSQ15_G: vacuous, INSQ15_H: priyanshu2501

anta was our last year winner.

Please follow our facebook event page for further notifications.

RESULTS:

Congratulations to our winners-

First place: anta again :)

Second place: yancouto

Still one problem left unsolved, lets see who gives it a green tick first :P

Here are the editorials of the contest.

Thank you,
Team Insomnia.

Note: The original blog was deleted by mistake, so I have written this blog once again, so that we can have a discussion over the problems.

I have read grid compression from this Quora link. But I didn't get the technique by which a grid can be compressed. I know the implementation of 1-D coordinate compression by using binary search technique, but I am not getting how a 2D grid can be compressed.

Here is the problem that I am trying to solve