Sorry, the implementation might be unauthorized, we're solving it...

https://mirror.codeforces.com/contest/2224/submission/373788886

The java implementation for 2224D solution 2 got TLE with Fenwick tree, but it passed with merge sort. Wondering why...

The solution for Problem $$$\textbf{Div2}$$$ $$$C$$$ is not clear!!

I created video editorial for D. Zhily and Barknights

can someone pls point out the mistake in this? (the function full of comments is taken from gfg)

Specifically, we have Mv=lcm(Mu,du). Then m≡Ru (mod Mu) implies m≡kMu+Ru (mod Mv), k∈[0,gcd(Mu,du)−1]. By enumerating all k and computing the corresponding r, we can obtain the congruence equation for su,r. If some r is not obtained, then the congruence equation corresponding to su,r has no solution.

Should not $$$k$$$ range over $$$[0, \frac{d_u}{\gcd(M_u, d_u)} - 1] $$$ ?

EDIT: I got it. $$$k \in [0, \frac{d_u}{\gcd(M_u, d_u)} - 1]$$$ if the modulus is $$$d_u$$$

I'm new here. Can somebody tell me why the source in the implementation shows "N/A"? Is my viewing permission sufficient?

can someone please help me figure out why my submission resulted in rte for preblem C? i used a binary searching like technique on centroid

https://ideone.com/OYXng2