Tanzim_bn's blog

By Tanzim_bn, history, 6 hours ago, In English

As 2024 nears its end, let’s share the problems we enjoyed the most this year so far! Drop the problem name, link and what made it special (optional).

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

»
5 hours ago, # |
  Vote: I like it +10 Vote: I do not like it

2044F - Easy Demon Problem Quite an interesting problem, looked really hard but had an easy mathematical solution (Do give it a try if you haven't).

  • »
    »
    4 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Would you mind giving some hints about it?

    • »
      »
      »
      3 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Think about how you could decompose the query that you have been given into parts that you can correlate with the orignal input.

    • »
      »
      »
      48 minutes ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Try factoring

  • »
    »
    74 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Indeed, this is one of the best questions I came across this year.

»
5 hours ago, # |
  Vote: I like it +15 Vote: I do not like it

1933E. Xor-Grid Problem It demonstrates the magical nature of XOR operations, completing the missing rows and columns in an array.

»
5 hours ago, # |
  Vote: I like it +10 Vote: I do not like it

1919D — 01 Tree Everything fits so nicely together!

»
4 hours ago, # |
  Vote: I like it +7 Vote: I do not like it

2029C - New Rating Although dp is easier to think here, the bin search solution is really satisfying.

»
3 hours ago, # |
  Vote: I like it +4 Vote: I do not like it

1843E — Tracking Segments binary search on the prefix sum!

»
3 hours ago, # |
  Vote: I like it +3 Vote: I do not like it

https://mirror.codeforces.com/contest/1931/problem/F It was such a nice thing to use cycle detection in a statement like this.

»
2 hours ago, # |
  Vote: I like it +15 Vote: I do not like it

Universal Cup 3.11 O - New School Term

I enjoyed being trolled by this problem. The final observation is so natural, yet so invisible. As far as I know, some LGMs were also trolled.

  • »
    »
    26 minutes ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Can you share the observation? My idea is a bit ugly.

    Spoiler
    • »
      »
      »
      25 minutes ago, # ^ |
        Vote: I like it 0 Vote: I do not like it
      Spoiler
»
2 hours ago, # |
Rev. 2   Vote: I like it +4 Vote: I do not like it

1977D - XORificator never seen this trick before and thought it was unsolvable before seeing the tutorial

»
110 minutes ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

ARC171E — Rookhopper's Tour

The setting feels very chaotic to me initially, but after thinking it though, it turns out there exist an elegant way to analysis the problem model very simply to make it solvable. It's just... astonishing!

»
43 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

D. YEET!

Not because I'm the author , but because the non-randomized solution is really satisfying and cool !

For Problems I solved , hmm

B. Shohag Loves Strings is cool.

D. Harder Problem is indeed a nice "harder" trolling problem .

»
38 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

https://mirror.codeforces.com/contest/321/problem/C

My 1st and only centroid decomposition AC

»
29 minutes ago, # |
  Vote: I like it +1 Vote: I do not like it

I don't know about best problem, but worst problem of the year is definitely problem C in APIO, the problem sucks A LOT