CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
Following the algorithm provided as hint ends up in TLE. I'm using C++. But anyway this was a great problem. I don't really care about passing the judge. Just as long as I know the solution
Now I get it, I was misinterpreting question all this time. Actually after finish of each round, lead is not the difference between points of that round. But the lead is difference between the points achieved through all rounds including current round - Lakpa Tashi Bhutia
Problem in short: We are given N pairs and from each pair we have to choose one element such that the difference between chosen sum and not chosen sum is minimized. N <= 150, value of elements <= 300.
I submitted my solution at IARCS Problem Archive. A fatal error just keeps coming up without any reason. There seems to be this error with every C++ submission on IARCS's grader.
Here's my solution for anybody who may require help:
Notes: This problem needs input-output optimization to run in time. If you are using C++ and you use cin to get your input, add these two lines to the beginning of the main function. You don't need to do anything if you use scanf.
The registration for ZCO and ZIO will start in the month of september , You should visit this website Indian Association f...
Read more… (42 words)
Read more (42 words)
NaN.
discussion
I already know python and algorithms and made some projects using it.Can anybody tell me that wether Asymptotic analysis comes in olympiad or not and help me in it.
There is no question directly from Asymptotic Analysis. But but but.. you can't dream of being at IOI (even INOI) without being able to find the time and space complexity of your code.