MiptLited's blog

Join the online Moscow Trainings Open Contest on May, 31
By MiptLited, 5 years ago, translation, In English

The remote championship on competitive programming starts on May 31 at 11:00 (Moscow) and will last for 5 hours. The tasks will have Division B level of complexity, so we recommend to participate people with blue, purple as well as yellow rating on Codeforces. We are waiting for teams with different competitive programming experience.

What you need to participate:

  • to know at least one programming language (C++, Java, Python or Kotlin)

  • a team up to three people

  • apply here and wait for confirmation letter from us

The contest will be held on ejudge platform. Winners will be awarded with the prizes from our partners: online English school Skyeng (for Russian participants) and JetBrains software development company.

BTW, JetBrains gives many opportunities to students for educational purposes. Explore free educational licenses.

See you at the championship!

  • Vote: I like it
  • +42
  • Vote: I do not like it

Comments Comments (25)
| Write comment?
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

I have two questions:

  1. Is everyone worldwide eligible?
  2. "Year of study" field is required for 2nd team member, but not for 3rd. Is there a mistake?
→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I have a question:

As mention above :: we recommend to participate people with blue, purple as well as yellow rating on Codeforces

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?

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Do we need to setup ejudge platform locally??

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

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?

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it +6 Vote: I do not like it

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!

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    Did they send confirmation mail immediately? I have just registered, but did not get any confirmation email.

    Edit: Got the Credentials. Thanks.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      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 :(

      → Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

We haven't got the credentials yet. MiptLited Please check

Edit: Received the Credentials. Thanks!

→ Reply
»
4 years ago, # |
  Vote: I like it +23 Vote: I do not like it

Permission denied by link from the email.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

→ Reply
»
4 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Where will the editorial be uploaded?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    We will send an analysis of the contest to each participant by mail

    → Reply
»
4 years ago, # |
  Vote: I like it +47 Vote: I do not like it

Is there any way to upsolve the problems?

→ Reply
»
4 years ago, # |
  Vote: I like it +5 Vote: I do not like it

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.

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it -37 Vote: I do not like it

    Because it seems to be default understanding and answer "no comments" or no answer means that you can rely to common sense.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +55 Vote: I do not like it

      Friendly reminder that what "obvious" might not the only "true" answer

      → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    How much space will MST consume?

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      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.

      → Reply