Shayan's blog

Codeforces Round 962 (Div. 3) — Video Tutorial
By Shayan, history, 5 months ago, In English

1996A — Legs

1996B — Scale

1996C — Sort

1996D — Fun

1995E — Decode

1995F — Bomb

1996G — Penacony — My Segtree solution

1996G — Penacony — Jiangly's XOR hashing beautiful solution

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

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

why we ignored ac and bc in ab+ac+bc<=n ??

→ Reply
  • »
    »
    5 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    We do not ignore those terms. We just know that it is necessary for ab to be <= n (not sufficient. Therefore, our second loop for b goes to n / a, not n.

    → Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why is this downvoted? I thought explanations were pretty good

→ Reply
»
5 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Great Explanations!

→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I still don't understand why for F we minus the total sum by the number of exceeding operations time x. Because what if before we transform a value to become smaller than x, that value is bigger than x and not necessarily equal to it? Can anyone explain further? Sorry for bad English.

→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why do we add the value computed for c to count in problem D?

→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The E question is almost exactly the same as the "skill upgrade" of the 13th Provincial Competition of the 2022 Blue Bridge Cup, and I have done this question before and memorized the answers in the solution, but I said that I checked the duplicate with other codes, but I don't know those people at all

→ Reply