Linearity of Expectation!
Difference between en1 and en2, changed 13 character(s)
Hello Everyone,↵
       I was solving this problem: [problem:722E][problem:]. 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!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English quid_ditch 2018-10-10 15:33:47 13 Tiny change: 'ved using linearity' -> 'ved using the lemma of linearity'
en1 English quid_ditch 2018-10-10 14:57:46 463 Initial revision (published)