Приглашаем студентов и школьников участвовать в онлайн-чемпионате по спортивному программированию. Чемпионат начнется 31 мая в 11:00 по Москве и продлится 5 часов. Командам будут предложены задачи уровня Дивизиона В. Участвовать может любая команда: от тех, которые уже имеют достижения на региональных чемпионатах, до команд-новичков, которые желают оценить свои силы.
Для участия нужно:
владеть хотя бы одним языком программирования (C++, Java, Python или Kotlin)
собрать команду до трех человек
подать заявку и ждать от нас письма-подтверждения
Чемпионат завершает восьмимесячный цикл проекта «Московские тренировки по спортивному программированию». В рамках проекта любой студент московского вуза мог бесплатно подготовиться к международным студенческим чемпионатам по программированию. Методистом тренировок был Филипп DPR-pavlin Рухович, лекции читали Андрей Сергунин, Евгений Белых, Владислав veschii_nevstrui Невструев и другие тренеры с опытом участия в крупных соревнованиях. Проект поддержан Фондом грантов мэра Москвы в 2019 году и проводился под руководством Физтех-Союза и Центра развития ИТ-образования МФТИ. Подробнее о проекте здесь.
Контест будет проводиться на платформе ejudge. После контеста для всех участников будет проведен онлайн разбор задач, подведение итогов чемпионата и награждение победителей ценными подарками от наших партнёров — онлайн-школы английского языка Skyeng и компании JetBrains.
Кстати, JetBrains предоставляет много возможностей для студентов, вот, например, бесплатные образовательные лицензии.
Присоединяйтесь!
I have two questions:
Nice to have downvotes for the correct observations -_-
I have a question:
So, if we participate in today's Div2 contest and by chance any of us becomes Cyan, will we be eligible to take part in it?
Do we need to setup ejudge platform locally??
А можно как то посмотреть, приняли ли твою заявку?
Сегодня мы будем рассылать подтверждения.
I've got an email with the confirmation of the registration. Our team has e-judge login from rucode. And it seems that I can enter to https://official.contest.yandex.ru/ with that login. Though, I don't see any contests there.
Where I can find link to e-judge server for the upcoming contest?
I've just got an email.
Thanks!
I have got confirmation for registration yesterday but still not got the credentials. The contest is about to begin in about 3 hours. Please help!
Edit: Got the credentials. Thanks!
Did they send confirmation mail immediately? I have just registered, but did not get any confirmation email.
Edit: Got the Credentials. Thanks.
No, confirmation mail was sent after some time (received confirmation at 4:30pm IST 30/5 i.e. after 20 hours of filling the form).
I queried 11 hours back about the credentials to which they replied they have sent the login IDs just then. But didn't receive yet :(
We haven't got the credentials yet. MiptLited Please check
Edit: Received the Credentials. Thanks!
Edit: It worked.
Permission denied by link from the email.
Same here, permission denied.
Our team didnt get the credentials.
Check the talks here
It'd be appreciated if you sent us any message regarding the problem. We are unable to log in and are hopelessly waiting to know what's happening.
Where will the editorial be uploaded?
We will send an analysis of the contest to each participant by mail
Is there any way to upsolve the problems?
In problem G, it wasnt mentioned that the lines are equally spaced. If the lines arent equally spaced, I can create a grid such that no 3 points in any of the diagonals are collinear. I even asked a clarification about this and no one responded.
Because it seems to be default understanding and answer "no comments" or no answer means that you can rely to common sense.
Friendly reminder that what "obvious" might not the only "true" answer
Is there a polynomial solution in Problem B if the routes don't necessarily have to construct a tree?
Probably a bit dumb but we wasted almost two hours at this(during the contest). And our clarification was ignored.
Statement of problem B didn't(?) clarify that the routes have to construct a tree, rather it said you can build at most n-1 routes. In other words, it wasn't mentioned that we consider a city visited if the salesman stops in that city. After reading the statement, though our intuition was MST*2, we disregarded it as we found a better answer for this case:
4
0 0
1 2
2 1
3 3
consider we have three routes(3<= n-1)
route 1 goes from 0,0 to 3,3... (0,0)->(0,1)->(0,2)->(1,2)->(1,3)->(2,3)->(3,3)
route 2 goes from 3,3 to 2,1... (3,3)->(3,2)->(2,2)->(2,1)
route 3 goes from 2,1 to 0,0... (2,1)->(2,0)->(1,0)->(0,0)
If we build the road this way the answer is 12(we use route 1,2,3.. remember route 1 covers (0,0),(1,2),(3,3) ) but MST*2 will give us 18. So creating a road this way would be optimal.
However, now I'm trying to solve the problem if the routes don't necessarily have to construct a tree. (in the case mentioned above, the answer will be 12).
Is there a polynomial solution? If so, Can anyone help, please?
How much space will MST consume?
I didn't get your question. However,
If your question was what's the space complexity of the algorithm for finding MST(in the original problem), then it's O(n).
If your question was whats the cost of the MST in the demonstrated case, then it's 9.
If your question was what's the space complexity of the solution for my version of the problem, then I don't even have a polynomial solution.