Hi, The LNM Institute of Information Technology, Jaipur is delighted to invite you to the "Inter University Programming Contest", during the three day Techno-Management-Literary Fest Plinth'18 to be held from 19th – 21st January, 2018.
The contest shall be a great opportunity for students to whet their programming aptitude. This national level programming contest shall assess the intelligence through various rounds: the first round will be held online on January 6th, 2018 and onsite round will be held during Plinth'18 (19th – 21st January, 2018).
I would like to thanks rhezo, 8shubham, vidhan for setting problems.
The key details of IUPC'18 are as follows:
- The first online round of the contest will be held on 6th January-2018 8 PM IST onward.
- Contest duration will be 5 hours.
- Team with maximum of 3 members is allowed.
- Contest will be held on HackerEarth
IUPC'18 Contest Link: Click Here .
Cash Prizes Of Rs. 20,000 up for grabs (For Onsite participants only)!!
Members of top 3 teams of Online contest will get T-shirts.
You need to register here if you wish to attend the onsite event.
For further details, feel free to contact us at [email protected] or visit our website Here
See you at the contest arena.
Good Luck!
EDIT 1: contest is live now
Auto comment: topic has been updated by killjee (previous revision, new revision, compare).
and the number of problems ?
8-10
Auto comment: topic has been updated by killjee (previous revision, new revision, compare).
string Problem_name;
cin>>problem_name;
if(problem_name contains killjee as substring)
{
cout<<"Ignore that problem,because it is difficult to understand the problem statement"
}
IN win some chocolates question was the intended solution using treaps??
Can we solve it using only fenwick trees or ordered set ??
Yes my solution was using segment trees using only
Need Hint on how to approach Pradyumn and chocolate cities (graph problem).
Break the problem into two parts :
Assume you have no data about the current city. Get the minimum distance b/w any two chocolate cities. You need to calculate this distance for each chocolate city.(Think about this how you can achieve it..?)
Next step, get the distance b/w current city and each chocolate city. As you already know the minimum distance b/w two chocolate cities for each city. You can get the final answer easily :)
killjee
The problem Can Killjee win some chocolates have wrong test cases. Your solution contains a line :
which is causing overflow and negative values are being printed.
We solved the problem correctly and were repeatedly getting WA verdict during the contest. After the contest when we changed ll to int the solution was accepted. We checked the test files, the correct output file contains negative numbers which is not possible as per the question.
Please rejudge all the submissions for this problem and for the problem Killjee wants to sort chocolates. Many teams suffered a lot because of these mistakes. This is not at all good.