Hello Community !! Hope u doing well
Just now , I have received a message from system , that my solution matches that with that of a user( i am not mentioning it ) . The problems was 1731D and we are aware that one part of the question(in which we had to find maxima for each k size square as already a renowned problem). I just added binary search to that already published solution. And as per rules, we are allowed to refer to articles published before the contest period.
It is my kind request to please accept my solutions and please revert my ratings. I know these types of blogs gets ignored but still if possible see in my case. MikeMirzayanov
Below attached is the link from which I took one part of the question , I just added binary search in my solution.
Link to the article(Refer to deNsuh comment(published on June 23, 2020)
My solution — Akpr/186930449
Plag Solution number — aaditya_20/186926164
Thankss!!
MikeMirzayanov Una_Shem I can provide for other evidence if needed.
It's sad that fair contestants and good researchers like you get skipped while obfuscators get a promotion! like that blog's cheater Mhmd_Bakr. Btw, thanks for the article ✪ω✪
Sed reality .. It would be more sad if MikeMirzayanov sir still accuses me of plag even i have provided all the evidence
yeah so sed! >_<. Please up and comment that blog so those who deserve a skip take it and standings get a fair reflection of everyone's performance tnk yuo ✪ω✪
MikeMirzayanov even I have got a similar message and mail for the same problem. I had also referred to the Leetcode discuss post mentioned by Akpr, and since the code was written and published/distributed before the start of the round, I think it should be acceptable.
Link to the Leetcode Discuss post.
Link to the playground code (this was public since June 23,2020).
Basically (MikeMirzayanov)i found out the minimum numbers in all k*k size matrix from 1 to n (this I took from pre published code) and then checked if if any minima is greater than equal to k then that qualifies to be our answer. Then since we know that if k1 is answer then all values <= k1 will also satisfy so I used binary search
Maintaining a separate ranklist for the Indians may end this problem. Peace!!!