CodeChef invites you to participate in the July 2012 CookOff at http://www.codechef.com/COOK24
Time: 2130 hrs 22nd July 2012 to 0000 hrs, 23rd July 2012 (Indian Standard Time — +5:30 GMT) — Check your timezone.
Details: http://www.codechef.com/COOK24/
Registration: Just need to have a CodeChef user id to participate. New users please register here
Problem Setter: Hiroto Sekido
Problem Tester: Maxim Kolosovskiy / Anton_Lunyov.
Problem Editorialist: Anton_Lunyov.
It promises to deliver on an interesting set of algorithmic problems with something for all.
The contest is open for all and those, who are interested, are requested to have a CodeChef userid, in order to participate.
Tags: algorithms codechef recent contest
Вопрос, я смогу сделать пару задач?Данным вопросом я прошу рассказать мне об уровне сложности задач!
@Prestige: Sorry I lost the meaning of your question in translation. Can you please ask it in English?
What is the difficult of problems?
There are 5 problems of varying difficulty levels. Refer this for more info: http://www.codechef.com/problemsetting#Cook-Off_Problems
Can i see the number of wrong test&
If you mean whether you can see the test data or not, then the answer is no. We will make all solutions public at the end of the contest and also publish editorials. You can then ask your doubts from our problem setters on our editorial pages.
А правда, что порядок числа это просто количество не 3,5,8 в записи числа? Мое решение опиралось на этот факт и не прошло.
нет, например 333333
Блин точно. Тогда ваще не понятно как ее решать. Разве что есть другой такой простой способ определить порядок
Нет. Если много 5 и мало 8, то это тоже влияет на порядок.
Это супер жесткая не правда, посмотри определение в условии и примеры. Там есть контрпример к твоему пониманию.
Very hard contest (2 last problems) ...
I got wrong answer in CEILTOMY.(number of shortest paths) ... I tried for over 1 hour but could not find the mistake in my code...Because of this my correct sub to CEILMAP was also delayed..Please somebody see my code and tell me where is it wrong...I am very anxious to know it..link
The roads are two-way.
Comiited a blunder :( Thanks any ways..
Well, that's unbalanced contest. 106 participants with three solved problems and only one with four. But I enjoyed the last two ones, thanks.
You can check the editorials here: http://discuss.codechef.com/tags/cook24/. Please feel free to ask your questions and discuss your doubts there.
What about practice?
Who have ideas to "Ciel Numbers III" ?
I had some and I really want to upsolve it. I thought that the answer should be the same length as the input =)
1 0 100 answer is 88
My approach for CIELMAP: "Find the convex hull of set of points and then iterate over every pair of point on the convex hull to find max length segment such that number of points on any one of the side of the segment is greater than 1"
O(nlogn) + O(n^2) : worst case
I got WA, why this approach is not correct ? Code
Your approach is wrong for the case N=4. Try test 0 0 2 0 1 2 1 1 With your approach you did not find the answer at all. But the correct answer is sqrt(5) since (0,0), (2,0), (1,1), (1,2) is a simple tetragon having side (1,2)-(0,0) of length sqrt(5).
Oh, that was a terrible mistake :(, need to improve a lot.
There are exist testcases that two farthest points doesn't lie in convex hull, but if n>=5 the answer is maximum distance.
That's impossible — two farthest points always lay on the convex hull
Sorry, I something mixed.
Described approach (I didn't read the code) should fail on this test (even if you count non-hull points as well):
4
0 0
0 4
1 4
2 5
Perhaps it would work if, when calculating npa and npb, you counted all points, not just points on the convex hull.
With 1250 test cases, it would have TLE'd.
The sum of N over all test cases is no more than 5000, so it would be OK.
I think it won't work for concave polygon.