Shayan's blog

Codeforces Round 960 (Div. 2) — Video Tutorial
By Shayan, history, 21 month(s) ago, In English

1990A — Submission Bait

1990B — Array Craft

1990C — Mad MAD Sum

1990D — Grid Puzzle

1990E2 — Catch the Mole(Hard Version)

Not a formal proof! (please explain the formal proof of the algorithm in the comment section if you know that)

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

Comments Comments (14)
| Write comment?
»
21 month(s) ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Congrats for reaching 10K dude <3

→ Reply
»
21 month(s) ago, hide # |
 
Vote: I like it +18 Vote: I do not like it

Why video editorial?

→ Reply
»
21 month(s) ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Can someone please explain problem D? I understood everything in the editorial up until adding the second dimension to the dp array. I don't get that part, why do we add dp[i][j] where j can be {0,1,2,3}? And is there a way to solve this without adding this second dimension?

→ Reply
»
21 month(s) ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

Problem D can be solved using greedy: https://mirror.codeforces.com/contest/1990/submission/271628945

→ Reply
»
21 month(s) ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

The "A.Submission Bait" problem really lives up to its name

→ Reply
»
21 month(s) ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

Problem D greedy solution with just 2 variables and one for loop: 271663296

Idea/Solution
→ Reply
»
21 month(s) ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Shayan, could you please answer this.... for Problem D, dp[i][j], j={0,1,2,3} what is the j here ? , is it {00,01,10,11} where each boolean value tell us about the use of the 1st and 2nd 2x2 block in i_th row ?

→ Reply
  • »
    »
    21 month(s) ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Exactly. It shows the 4 possible ways for the 1st and the 2nd 2*2 block in the row number i.

    → Reply