schrodingerstom's blog

Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial
By schrodingerstom, 7 hours ago, In English

2224A - Zhily and Array Operating

Tutorial
Implementation

2224B - Zhily and Mex and Max

Tutorial
Implementation

2224C - Zhily and Bracket Swapping

Tutorial
Implementation

2224D - Zhily and Barknights

Tutorial
Implementation

2223C - Zhily and Signpost

Tutorial
Implementation

2223D - Zhily and Cycle

Tutorial
Implementation

2223E - Zhily and Permutation

Tutorial
Implementation

2223F - Zhily and Colorful Strings

Tutorial
Implementation
  • Vote: I like it
  • +23
  • Vote: I do not like it

»
4 hours ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

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

→ Reply
  • »
    »
    3 hours ago, hide # ^ |
     
    Vote: I like it +5 Vote: I do not like it

    should be fixed now

    → Reply
»
3 hours ago, hide # |
 
Vote: I like it 0 Vote: I do not like 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...

→ Reply
»
3 hours ago, hide # |
← Rev. 2  
Vote: I like it +7 Vote: I do not like it

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

→ Reply
»
3 hours ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I created video editorial for D. Zhily and Barknights

→ Reply
»
3 hours ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
71 minute(s) ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it
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$$$

→ Reply
»
47 minutes ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
38 minutes ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

→ Reply