Awesome!

Since the schedule is settled it would be nice to open a registration for the contests already :)

Can I use C++ in this contest?

Is it open to high school students? Because I can't find any rule against it

Why limited to "resident of Eastern Europe (including Russia), South Asia or Southeast Asia "?

Can we just solve problems? Because I'm study at school.

Do we have accesses to past contests problems ?

I'm just disappointed that nobody asked The Question.

What exactly does Eastern Europe include? Only Russia, Belarus, Ukraine, and Moldova?

In typical competitive programming rounds, we are fully allowed to use the Internet — even directly copying any code which was available prior to the start of the round. Does the same policy apply in this contest as well?

I am also amazed at this very different approach for admitting students/providing scholarship compared to other universities. Hope this program continues next year as well when I graduate.

Can you please add the Contest Link here so that we can enter contest easily MikeMirzayanov

What is the world ranking of SIT?

I filled out the contest registeration form more than 20 minutes ago, but I haven't received the confirmation email message at the email address specified in the form yet. What should I do?

MikeMirzayanov Do we have any info as to what time of the day the contest on June 17 will begin? It's not written anywhere

Best contest for student Great opportunity to get scholarship

I have registered for the contest. But still I am unable to practice on the platform through the login details provided in the mail. Please help

What time will the contest take place on (UTC + 7)

I have registered for the contest and also i have got the password but when i click the link it says that i am not a group member and also it say access denied.What can i do?

Where is the link to the practice contest? It should be available from 1st June.

Only div2 D problem statement was kinda confusing.remaining all problem statements are crisp and enjoyable.

This was not at all a good contest the time limit for Problem B was too strict and the problem statement for Problem D was literally Shit.

Are there T-shirts?

According to the announcement, the practice contest will last for one week but at the contest page, it is showing 2 months....?

Was the contest postponed 1h or is it just my imagination?:))

Problem L is nice, although well-known (see here for 3D-case and page 4 for specifically 2D).

First you split everything into squares:

┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐
└┘└┘└┘└┘└┘└┘└┘└┘└┘└┘
┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐
└┘└┘└┘└┘└┘└┘└┘└┘└┘└┘
┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐┌┐
└┘└┘└┘└┘└┘└┘└┘└┘└┘└┘

Then you generate random spanning tree on them and break walls between neighbours:

┌┐┌────┐┌────┐┌────┐
││└─┐┌┐││┌──┐││┌┐┌─┘
│└──┘││└┘│┌─┘└┘││└─┐
└─┐┌─┘│┌─┘└───┐│└─┐│
┌─┘└─┐│└───┐┌─┘└─┐││
└────┘└────┘└────┘└┘

It doesn't cover all possible Hamiltonian cycles, but we don't need it either, just some seemingly random is enough. To generate uniformly distributed random spanning tree, you may assign each edge random value and find the MST. Or just random shuffle all edges and do something similar to Kruskal's algo, it will do the same thing.

Problem K was also interesting. Can anybody prove that comparing $$$t_a + \max(d_a, t_b + d_b)$$$ and $$$t_b + \max(d_b, t_a + d_a)$$$ maintains total order on the dish set? It's not obviously transitive.

Will there be editorial published?

Problem K was dp right?? States are obvious but first we will have to sort on pre(t[i])+d[i]. How to solve it? My logic was to find dp (dp[i][j] = min cost to select j elements till index i) then backtrack to find elements.

Good contest, especially for beginners. Upto problem F, problems were easy. Problem G and H were somewhat interesting. Problem I and J were again easy (J was not exactly easy problem on its own, but it took only a simple search to find the solution).

Could not solve K and L, but both seem very interesting.

What is wrong with the following solution for the problem K?

We do binary search on answer time T. It means that every dish must be finished cooking not later than T — d_i. Here we come to standard problem: each dish(task) has duration t_i and deadline T — d_i , looks exactly like e-maxx (translation ), doesn't it?

Unfortunately, I've completely forgotten about the contest (and there were no reminder emails or something). Can I now see the statements somehow? I cannot even see the final standings because I'm not registered to the contest.

In Problem L sample case, it says that the longest equal substrings in FRFFLFLFFRFRFFFRFFFRFFFR have lengths of 11.

The longest that I can find are two FRFFFRFFFRs which are of length 10. Is this an error or am I missing something here ?

Is there a way to solve the contest for practice purposes? I cannot find a way to access the contest now since I didn't register.

What is the minimum rank required to get shortlisted for interview ?

It's been almost 2 weeks and still haven't heard anything. When will the results be published regarding who's been selected for interviews?

Still waiting.....