An unsolved problem from an Korean ICPC contest

Revision en1, by .o., 2018-10-12 08:37:29

Last week, there was a preliminary ICPC contest in Korea, whose result is used to select teams from various universities to advance to the Seoul Regional (regional contest in Korea)

This is the problemset: http://icpckorea.org/2018/preliminary/problems.pdf

Most problems were solved, at least algorithmically, by people during the contest or after the contest. However, anyone, including some top-tier people in our country, couldn't solve problem C.

In the contest, problem C was solved, but it was just because the test data was super weak to allow solutions with complexity O(n2 / k) :p Since the description is short enough, I will not describe the problem here, just click the link to see the task.

I am really curious about the solution of this problem. Could I get some hints about this task? Thanks in advance :)

Tags icpc, seoul, strings

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English .o. 2018-10-12 08:39:24 22 Tiny change: 'ome hints about this task' -> 'ome hints or entire solutions for this task'
en1 English .o. 2018-10-12 08:37:29 941 Initial revision (published)