lperovskaya's blog

By lperovskaya, 5 years ago, In English,

We gladly invite you to participate in the Three Subregionals Cup 2014 – a team-based online programming competition parallel to the ACM ICPC Subregionals in Moscow, Minsk and Saint Petersburg. The tournament will be organized by the team of Yandex.Contest and the jury of the Subregionals. The online rounds will be held on the Yandex.Contest system. The dates and start times of subregionals are: Moscow (registration) – October 26th, 11:30 MSK, MinskNovember 6th, 12:00 MSK, Saint Petersburg – November 8th, 12:30 MSK.

Teams that participate in the onsite version of one of the three quarterfinals will be able to participate in the online versions of the other quarterfinals via Yandex.Contest. Teams that don’t participate in any of the three quarterfinals onsite will be able to participate in all of them online via Yandex.Contest. Cumulated results of three subregional contests will be calculated based on Grand Prix 30 scoring system.

You can register for the online rounds at any time. You can represent a single person or create a team using the My teams link. Each invited team member has to confirm his participation in the team. You can choose participation type and team members upon registering for the contest. Note that OpenCup dedicated logins will not work at this contest!

The rules of the online rounds correspond to the onsite quarterfinal's rules.

For your convenience a test contest is available.

UPD Official Moscow QF results

UPD2 Western QF is right around the corner!

UPD3 Northern QF will start tomorrow at 12:30 MSK.

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

»
5 years ago, # |
  Vote: I like it +20 Vote: I do not like it

could you put these three contest into the gym,thanks

»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Подскажите как решить G?

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

    Будем решать задачу отдельно для каждой фамилии. Построим ориентированный граф из имён, в котором есть ребро u->v тогда и только тогда, когда во входных данных есть "u son of v".

    Посчитаем для каждой вершины D[v] количество вершин в наибольшем пути начинающемся из неё. Если бы в графе не было циклов, то это можно было бы сделать простым дфсом. Заметим, что в каждой компоненте получившегося графа будет не более одного цикла, при этом он всегда будет находиться в конце любого пути. Найдём его, и присвоим для каждой вершины v, входящей в него D[v] = число вершин в цикле. После этого, для нахождения D[v] для остальных вершин в компоненте, будет работать обычный дфс.

    Ещё нужно учесть тот факт, что если в компоненте нет цикла, то ответом будет maxD[v] - 1, так как последней вершины в получившемся пути нет в инпуте, поэтому мы не можем её использовать.

»
5 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Great contest, thanks to the organizers! The contest in the Gym: 2014-2015 ACM-ICPC, NEERC, Moscow Subregional Contest.

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

thanks for providing,and another request,is that available for you to put the Central Subregional 2014 contest into gyms,millions of thanks

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

Tomorrow there also is Georgian subregional. Can we have it online somewhere?

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

    All subregionals tomorrow will have the same problems

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

      Really, not all: Far Eastern and West Siberian will have their own problemsets.

»
5 years ago, # |
  Vote: I like it +12 Vote: I do not like it

Is the final result of Northern QF available now? I'm very eager to see whether tourist's team has solved the last problem