Блог пользователя Omar_Mohammad

Автор Omar_Mohammad, история, 5 месяцев назад, По-английски

I wanted to share an idea that could potentially enhance our experience within codeforces community.

At times, individuals encounter gyms of varying quality that may not align with their expectations, leading to a suboptimal use of time and effort. In light of this, I propose if we can have a Gym Rating System, similar to rating blogs. I think this will help to save time and have a more comfortable experience. feel free to share your opinion and if you are with or against!

Полный текст и комментарии »

  • Проголосовать: нравится
  • +134
  • Проголосовать: не нравится

Автор Omar_Mohammad, история, 9 месяцев назад, По-английски

I have been stuck for days on this problem with no progress so any help will be appreciated.

the problem if the image is not clear: given two strings s and t(|t|, |s| <= 1e5) and q queries (q <= 1e6). let's denote by t(a, b) as the substring of t that starts at a and ends at b. each query is of the form: l, r, i, j find the number of occurrences of t(l, r) + t(i, j) in s. where "+" is the concatenation operator. the sum of |t|, |s|, and q over all test cases <= 1e6.

Полный текст и комментарии »

  • Проголосовать: нравится
  • +3
  • Проголосовать: не нравится