Please subscribe to the official Codeforces channel in Telegram via the link ×

quid_ditch's blog

By quid_ditch, history, 3 years ago, In English

Hello Everyone, I was solving this problem: 722E][PROBLEM: - Research Rover. I was able to solve this by counting the number of paths that pass through the 0, 1, 2 and so on anomalies along with the sum of anomalies of each path. But I am wondering whether this problem can be solved using the lemma of linearity of expectation (LOE). LOE is quite trivial on 3000 * 3000 grid. But how to do LOE when size of grid is 1<=n,m<=1e5.

Thanks in advance!

Read more »

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