ACM, Bits Pilani Hyderabad campus is organizing the their flagship coding competition, CodeWars. This year's problem setters include pranet, de_inferno, sasuke_uchiha, lone_rider and YashRaj.
It will be a 3-hour ICPC style contest with 5 problems and binary scoring. It is an individual contest(Teams not allowed). The contest will be held on Hackerrank.The contest link will be updated soon.
The contest starts at 21:00(IST) on 5th October, 2015. time
Contest link : link
UPD 1 : The contest is about to start in an hour.
UPD 2 : The problems have been served. The fifth problem will be released within half an hour. Sorry for the inconvenience caused.
UPD 3 : The contest is over. I hope you liked the problems. We'd like to thank the external problem setter pranet to set the last two problems. The prize winners will be contacted soon, once the 1/100 points glitch is handled.
UPD 4 : The final standings are as follows :
Rest of the world :
1st zemen
2nd kalimm
3rd MrDindows
India :
1st satyaki3794
2nd Karthik21996
3rd tanmayc25
Follow this page for further updates.
PS : Instead of discarding an edit I discarded the previous post by mistake.
Auto comment: topic has been updated by rtheman (previous revision, new revision, compare).
Auto comment: topic has been updated by rtheman (previous revision, new revision, compare).
Is it normal that some problems that were accepted using one attempt were not scored with 100? After sending the same accepted code for th second time it gets 100.
What about taking 1 point instead of 100 points? :(
Let me guess... Only Indians eligible for prizes?
I think that it was a contest without prizes, because it was not said anywhere about them.
Look at the picture
Oh, I did not notice it.
Did anybody do question 4 with persistent segment tree?
I tried doing it but could clear only 5 test cases.
How to solve Subtree Queries? I tried to use segment tree + binary search.
Easy solution with fast set merging. #u2JvvG
Cool, thanks :)
I think it's not that easy without your awesome tree thing :D
It is not so hard to implement it using segment tree anyway :)
adamant thanks :) for providing your solution and introducing me to order tree structure. Could you please explain what is the space and time complexity of your code? I think I kind of understood why you have implemented offline solution for answering queries and that swap trick so that time and space complexity are met ... even though could you explain complexity :p
Space complexity is
but it can be easily reduced to 
by deleting useless sets from children of vertex. Time complexity is 
. It is easy to see that if element moved from less set to the bigger one, size of new set will be at least twice bigger than old one. So each element will be inserted no more than 
times.
Using MO's and a balanced BST (i used treap because i had a template written. You can use policy based structures ) to support insert, delete and kth element in O(logN). https://ideone.com/GxynE1
We'll be contacting the prize winners and update the final standings soon. The 1/100 point glitch needs to be handled manually. Don't know why it happened.
Will you publish new standings or update the standings on Hackerrank?
Edit : I didn't see the new standings. Sorry for asking.
Auto comment: topic has been updated by rtheman (previous revision, new revision, compare).
Auto comment: topic has been updated by rtheman (previous revision, new revision, compare).