Пожалуйста, прочтите новое правило об ограничении использования AI-инструментов. ×

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

Автор Aspergillus, история, 22 часа назад, По-английски

Hello all today I struggled a lot with C2, especially because I am not used to using sets, actually not used to using any data structure other than map or vector, I have used queues for BFS only. So I have decided to spend a few days with them.

Please suggest some problems, which are not higher than maybe 2000 rated on CF equivalent, which cannot be solved in desired time or memory without specific data steuctures. One example is stacks for finding the nearest element smaller in the left/right using stack (or vector with push back). Another example maybe using sets to maintain indexes of appearances with updates, which was used in C2. Some people say some sorts of balanced paranthesis substring problems can be solved only using stack but I have only ever used a map for that purpose at best.

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

»
21 час назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

APIO14_palindrome

  • »
    »
    15 часов назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Thanks!

»
21 час назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

C2 was crazy. I don't wanna say that that sort of problem is boring, but there is a time and a place for those sort of things. Certainly the appropriate place isn't a div. 2 C, is it?

»
15 часов назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится
»
9 часов назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

I'm not sure what you're complaining about for C2. AFAIK the problem doesn't need any advanced techniques. My solution only uses basic understanding of arrays and a set. 284778921

  • »
    »
    7 часов назад, # ^ |
      Проголосовать: нравится +3 Проголосовать: не нравится

    No part of the post is complaining about C2. Also not sure what part of the post mentioned it uses "advanced techniques", only that I am not familiar with using even sets as a data structure.

    Also, I prefer Jiangly's solution.

    • »
      »
      »
      6 часов назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      In that case I'm not sure what the point of the post is. Does your title not suggest that setters should drop problems such as C2 or those that require advanced data structures? I think that instead of making setters conform to your skill issues, you should git gud. Creating interesting problems is already hard without imposing more restrictions.

      • »
        »
        »
        »
        6 часов назад, # ^ |
        Rev. 2   Проголосовать: нравится +2 Проголосовать: не нравится

        You are misunderstanding things. By "drop" I mean "comment below" and not drop from the set.

        PS: You known what, I'm sorry for being rude in the last edit, it was just a misunderstanding, I overreacted. I'll just apologise and move on.