### arvindf232's blog

By arvindf232, history, 11 days ago,

UPD: The round has been rescheduled to a different time due to a clash with a CodeChef contest

Hello CodeForces!

Me, happypotato1207 and nicholask are excited to invite you to participate in Codeforces Round #822 (Div. 2). It will start at Sep/23/2022 15:05 (Moscow time). The round will be rated for everyone with less than 2100 rating. You have 2 hours to solve 6 problems. Please note the unusual start time.

We would like to take this opportunity to thank everyone who have contributed to our round:

We look forward to seeing you on the leaderboard!

UPD: Score Distribution: 500 — 750 — 1250 — 2000 — 2250 — 3250

UPD2: Editorial

UPD3: Winners!

Div 1 + 2:

Official:

• +362

 » 8 days ago, # |   +96 As a co-author, the problems are nice and I recommend everyone to join this contest!
•  » » 8 days ago, # ^ | ← Rev. 2 →   +64 As another co-author, I can assure that problems are great and I also recommend everyone to join!!
•  » » » 8 days ago, # ^ |   +56 As a tester and not a co-author, the problemset is very amazing and you should join the contest!
•  » » » » 8 days ago, # ^ | ← Rev. 2 →   -56 As a participant and not a co-author or tester, i will surely join the contest.Why are u downvoting for just no reason.
•  » » » » » 5 days ago, # ^ |   +21 If you ever ask why people are downvoting you for no reason, just know that you'll get a shit ton of additional downvotes just for that
•  » » » » 7 days ago, # ^ |   0 As another tester, I agree with you!
•  » » » » » 6 days ago, # ^ | ← Rev. 2 →   +52 As a newpie, Downvote me
•  » » » » » » 6 days ago, # ^ |   +50 As a non-ratist, I upvoted.
•  » » » » » » » 5 days ago, # ^ |   +4 I wish my contribution would be non-negative (❁´◡❁)
•  » » » » 5 days ago, # ^ |   -14 As a participant and not a co-author or a tester, i highly recommend this amazing contest with those amazing problemes
•  » » » 7 days ago, # ^ |   +21 My translator is so bad that it translates great problems into big problems.LOL
•  » » » » 7 days ago, # ^ |   -6 Learn Engrishu
 » 8 days ago, # |   -12 Ooh, a very early announcement. This should be good news.
 » 8 days ago, # |   +11 Hopefully I will solve two problem this time. All the Best to everyone .
 » 8 days ago, # |   +44 Yaay
 » 8 days ago, # | ← Rev. 2 →   +8 Very excited to participate, gl everybody
 » 8 days ago, # |   +1 My rating is 822. 822E-Liar
•  » » 7 days ago, # ^ | ← Rev. 2 →   0 Your rating is 1064. You're a 822E - Liar!
•  » » » 5 days ago, # ^ |   0 neat graph
 » 8 days ago, # |   +128 CodeChef Lunchtime is clashing with this round. After a long time, CodeChef is having a rated contest for div 1. I think many of us want to participate in both the contests so could you change the date or timings of the round (if possible)?arvindf232 happypotato1207 nicholask
 » 8 days ago, # |   +37 As a tester... I have nothing to say other than good luck.-QuangBuiCP
•  » » 7 days ago, # ^ |   0 I like Takina more than Chisato. BTW I wonder what you study at the Institute of Sexology?
 » 8 days ago, # |   0 As an Unrated... I will make sure to make me rated.
 » 8 days ago, # |   0 in last div 2, i did question 1 very quickly,i figured out question 2 quickly 2 and coded it but wasted my 1 hour just coz i had a wrong value assigned to a variable, made wrong submissions many times, and question three which was very easy i could not figure it out coz i wasted my energy alot on the second one. this is me in literally every contest and im even loosing hope now.can someone please guide me how to fix these issues, i can never maintain pupil due to these sillly mistakes.
•  » » 8 days ago, # ^ |   +16 you made a mistake, and you will not do it again. Im sure that there a finite amount of doable mistakes, so just attend more contests!
•  » » » 7 days ago, # ^ |   0 reisss
 » 8 days ago, # |   +27 Hong Kong Round! Support!
 » 8 days ago, # | ← Rev. 2 →   -20 -
 » 8 days ago, # | ← Rev. 2 →   0 Can you guys please reschedule this round little bit as the contest time is intersecting codechef lunchtime contest(If possible) . Because many of us will willingly want to participate in both contests. But if the contest time collides it is hard to choose one contest Between them. Please "_|_"
 » 7 days ago, # |   +3 As a participant, I will participate in this competition to improve my strength
 » 7 days ago, # |   -13 I hope reach CM after this contest ಥ⁠‿⁠ಥ
•  » » 7 days ago, # ^ |   -7 i love your graph haha
•  » » » 7 days ago, # ^ |   -7 -100 +100 -100 +100 :'(
•  » » » » 7 days ago, # ^ |   -10 any tips for me to reach specialist , other than fast ABC
•  » » » » » 7 days ago, # ^ |   -7 Practice 1500+ rated problems
•  » » » » » » 6 days ago, # ^ |   -9 I practice 1200-1500, I thought that would help me reach specialist because I struggle with div. 2c 2/5 times during the contest, am I doing it wrong?
•  » » » » » » » 6 days ago, # ^ |   0 yes u should always pratice problems of higher rating than your current one.So donot waste time in 1200 go for 1400+ ones.
•  » » 6 days ago, # ^ |   0 Wishing you luck :)
•  » » » 6 days ago, # ^ |   +1 ty bro <3
 » 7 days ago, # |   +4 lucky
 » 7 days ago, # |   -10 Plz keep the original starting time but re-schedule to a different day
•  » » 6 days ago, # ^ |   +13 No way, i think it's much better than before, but each person's experience depends on the local time zone, which is something that cannot be done perfectly ^-^
•  » » » 5 days ago, # ^ |   0 In my opinion, time zone is not the main problem. What matters more is that it's preponed... And I happen to be one of the unlucky guys who missed this round because of that...
 » 6 days ago, # |   +6 Oh,Very excited to participate .
 » 6 days ago, # |   0 Alright, time to comeback and on my way back to 1k4 after I throw a lot of contests down the drain
 » 6 days ago, # |   0 Lets hope ill mange too make 2 problems :))
 » 6 days ago, # |   +20 The contest has been preponed. Do not miss it! All the best everyone!
 » 6 days ago, # |   +18 Respect++ For respecting codechef :)
 » 6 days ago, # |   0 i hope get delta >= 5
 » 6 days ago, # |   0 Good luck everyone.
 » 6 days ago, # |   +5 sad for west coast :’(
 » 6 days ago, # |   +13 Just noticed the contest was preponed.I think postpone is far better than prepone. Many people registered the contest and back online on the time the contest was scheduled. prepone could make them miss the contest, but postpone won't.
•  » » 5 days ago, # ^ |   +8 I think sending a mail to everyone who registered might be a good idea to avoid that.
 » 6 days ago, # |   +13 As a uni student who would have been unable to attend this contest due to it being during my classes, I am very grateful for this opportunity.(Yes it would be 5am in my local time, but I literally don't care.)
 » 6 days ago, # |   -22 Can you help us ? here -- > World War III will begin D:
 » 6 days ago, # |   +47 Why is cf accomodating for codechef and not the other way around?
•  » » 5 days ago, # ^ |   0 Maybe codechef have more money.And money talks
•  » » 5 days ago, # ^ |   +15 Because codeforces cares for us
•  » » 5 days ago, # ^ |   +1 Codechef had postponed its previous contest from 21 to 22 Sep. So they are like its your turn now.
•  » » 5 days ago, # ^ |   0 CodeChef is holding rated round for div1 after almost a month thus many don't want to skip it. If no contest accommodates it think many will end up giving CodeChef round.
 » 5 days ago, # |   +9 As someone waking up at 4:30 to do this contest, please let me solve ABCD.
•  » » 5 days ago, # ^ |   +6 Only you have to solve the problem. Only way someone else can let you solve a question by giving hints or telling solution which is cheating so you are going to cheat
•  » » » 5 days ago, # ^ |   +3 bruh
 » 5 days ago, # |   +4 codeforces are very kind for programmer who rescheduled their contest timing because of codechef contest time at same time.
 » 5 days ago, # |   0 CodeChef contest is 3.5 hours long why??
 » 5 days ago, # |   0 Codeforces Language Picker -- chrome extension to fix codeforces language picker.
 » 5 days ago, # |   +8 20:05-22:05 UTC+8 is friendly to Chinese!
 » 5 days ago, # | ← Rev. 2 →   +5 finally, the contest at 9 pm
 » 5 days ago, # |   0 3250.
 » 5 days ago, # |   +5 I like this Score Distribution : 500 — 750 — 1250 so much
 » 5 days ago, # |   +8 I hope I become expert in this contest... :)
•  » » 5 days ago, # ^ |   +5 All The Best!!!
 » 5 days ago, # |   0 The contest has been preponed ...Nice!
 » 5 days ago, # | ← Rev. 2 →   0 UPD: Resolved thanks!
 » 5 days ago, # |   0 My calendar didn't reflect the time update, I am wondering whether I registered from a wrong source. If anybody's calendar works correctly pls let me know, thanks!
 » 5 days ago, # |   +10 I happen to be one of the unlucky guys who missed this round because of the prepone. I came online just to find that the contest has already started... Perhaps changing the date might be a better idea than preponing in such short notice?
 » 5 days ago, # |   -13 Wrong answer on pretest 1,Wrong answer on pretest 2,wrong answer on test 1,runtime error,Time limit exceeded,Memory limit exceeded,Compilation error.I loves wrong and error,I love bad rating.
 » 5 days ago, # | ← Rev. 2 →   +3 What the hell....I missed this contest :(Didn't even received a mail about time change.congratulations to all who will get positive delta due to this time change, not in my wildest thought had I even thought this way of improving rating. I hear "CHECKMATE" from admin.
•  » » 5 days ago, # ^ |   0 I literally did AB first and ate dinner then do C later only because of the time change TT. If it wasn't for the time change then maybe i could finish C quick enough:(
•  » » » 5 days ago, # ^ |   +1 I don't know bro. Maybe we need to practice for these time changes as well here.
 » 5 days ago, # |   +2 Why is Codeforces such busy today? Even m1,m2,m3 are sometimes busy. But this contest is surely pretty good.
 » 5 days ago, # |   +1 Someone solved E in 3 min. That is insane
 » 5 days ago, # | ← Rev. 2 →   0 It was a nice contest. i am waiting for a day when i will be able to solve div2 D.is there anyone who can tell me how to approach problem D?
•  » » 5 days ago, # ^ | ← Rev. 3 →   +7 I used two pointers approach. IdeaI started at position k and sent pointers l(=k-1) and r(=k+1) towards both ends. I saved the position of the maximum gain I got until my (gain + hp)>=0 and moved towards the direction which gave me the most hp gain(=k=(gain[l]>gain[r] ? l : r). If at any given time my l and r didn't move, it meant I couldn't find a positive gain and it didn't matter if I moved at all, so the answer is no. If at any point I managed to get to one of the ends, it meant my (gain[l] + hp) || (gain[r] + hp) was enough to reach one of the ends and the answer was yes.My solution: 173216964P.S: This probably could be done much cleaner, but I couldn't come up with it in time on contest.P.P.S: Scrap this, I got TLE because my solution isn't optimized enough, but the idea is somewhat correct.
•  » » » 5 days ago, # ^ |   0 This is what i was thinking during the whole contest.But wasn't able to implement it.
•  » » » » 5 days ago, # ^ |   0 My solution lacks the optimization to not recalculate the whole route from k to the last l I checked, so it TLE's, but the idea in general is the same, so my implementation isn't correct either. welps
•  » » » 5 days ago, # ^ |   0 Alex.Svanidze I did something similar but didn't TLE. I didn't submit it in the contest thinking it'll TLE. 173232461
•  » » » » 5 days ago, # ^ |   0 I guess me updating the values to zero changed it? lol, dunno, didn't really dive into your code, it looks quite similar, but there might be a significant one-liner difference
•  » » » » 5 days ago, # ^ |   0 Looking at it now, there is a huge difference. You check for the left and right separately, for just once. I go with loops until I reach a non-valid point. If the testcase needs to run on zig-zag, I will recalculate the whole segment between l-r and my solution will go up to n^2, yours will never exceed linear imo.
•  » » » » » 5 days ago, # ^ |   0 I'm not quite sure whether it'll exceed linear or not. But if I'll divide the slimes into groups as mentioned in the editorial then I can be sure that it'll be linear because we on 2 checks at least one pointer will move, if it'll not move then it's impossible. There is no overhead of reiterating on the already seen indices. But in case of my solution without groups we are reiterating on some sets on points again and again.
 » 5 days ago, # |   0 how to do c?
•  » » 5 days ago, # ^ |   0 You can do it like a sieve of Eratosthenes
 » 5 days ago, # | ← Rev. 2 →   -11 .
 » 5 days ago, # |   0 How to solve D? I was able to do recursive DP but that was MLE.
•  » » 5 days ago, # ^ |   0 I do only recursive only. How to do recursive dp?
 » 5 days ago, # |   +8 How to solve E?
•  » » 5 days ago, # ^ | ← Rev. 2 →   +15 I solved it like this. I'm not entirely sure why this worked. 173206034 Edit: See Shisuko's post below. That's why this worked.
•  » » » 5 days ago, # ^ |   0 same:))
•  » » 5 days ago, # ^ | ← Rev. 2 →   +33 For this proof, we assume that the matrix is $0$-indexed, i.e. $0 \leq r < n$ and $0 \leq c < n$. Also, note that this is exactly the same as OleschY's solution shown above with the really nice visual diagram. So just read this if you're interested in a proof of correctness hahaNote that the condition is equivalent to saying a[r1][c1] - a[r1][c2] != a[r2][c1] - a[r2][c2] (mod n). Let d_{c1, c2}(r) = (a[r][c1] - a[r][c2]) mod n; for a fixed (c1, c2), we want d_{c1, c2} to be distinct for different input values of r. But now we can see that we are very limited---there are n possible values of r, but also n possible different outputs of the function. So we want this d_{c1, c2} to be some permutation of 0 to n-1.Let's set the matrix such that a[r][c] - a[r][c+1] = r always holds. Then, note that this implies (by induction or whatever) that d_{c1, c2}(r) = (c2 - c1) * r mod n. But if (c1, c2) are fixed, then (c2 - c1) is just some nonzero constant, and because n is prime, we know that d: r -> kr mod n is a permutation for any nonzero k.
 » 5 days ago, # | ← Rev. 2 →   0 In problem C, why can't we just choose k=1 every time? S must contain a number multiple of k=1 and this/any number can therefore be removed with cost k=1.
•  » » 5 days ago, # ^ |   0 If we dont have to remove 2 then the smallest factor of 1 will be 2.
•  » » 5 days ago, # ^ |   +5 You are required to remove the smallest multiple.
•  » » 5 days ago, # ^ |   +5 u can only remove smallest multiple of k.So if 2 is there in T then if u select 1 twice then the second time 2 will also be removed.Which is wrong.
•  » » » 5 days ago, # ^ |   0 Thank you! So we can just delete all multiples up-to a multiple that is in the target T. example if S={1,2,3,4} T={3} with k=1 we can delete just {1,2} because the smallest multiple remaining is 3 and that has to stay in T.
•  » » » » 5 days ago, # ^ |   0 yes
•  » » 5 days ago, # ^ |   +1 what if lowest multiple of 1 needs to remain?
•  » » 5 days ago, # ^ |   0 you delete smallest multiple of K present in S.
 » 5 days ago, # | ← Rev. 3 →   +22 Problem D has the same idea with Circle Eating in Codechef. But in codechef contest, only 8 people get AC in contest, otherwise there are over one thousand people pass pretests in Codeforces Contest! It's amazing.
•  » » 5 days ago, # ^ |   0 How to solve D?
•  » » » 5 days ago, # ^ | ← Rev. 3 →   +4 If I don't misunderstand the meaning of problem, you can see the editorial in Codechef to get the main idea.P.S. update the link of editorial. P.S.2 it seam the solution of the two problems are quite different...
•  » » » » 5 days ago, # ^ |   +3 Editorial is a Pro feature now on Codechef............
•  » » 5 days ago, # ^ |   -36 This contest should be unrated!
•  » » » 5 days ago, # ^ |   +1 pls no
 » 5 days ago, # |   0 Thank you so much for problem E! I (don't) wish you good health, love, high esteem and respect from loved ones, achieving your dreams to infinity, happy life, have magical moments and memories, and obtain what you really want, because that is the only way to fulfillment, realization and happiness!
 » 5 days ago, # |   0 Why is My Submission to D failing test case 10 :( . Can anyone explain? Thank you!Code : 173206067
•  » » 4 days ago, # ^ |   0 Take a look at Ticket 16213 from CF Stress for a counter example.
 » 5 days ago, # |   0 Did Problem D just 15 seconds after the contest :(
 » 5 days ago, # |   0 I don't know why Codeforces is really laggy today, even m1.codeforces. By the way, can somebody tell me a case where I got the wrong answer on Problem D. I got WA on 3rd pretest. Thanks alot <3 <3 <3 Here is my submission: 173222229
•  » » 5 days ago, # ^ | ← Rev. 3 →   0 Try this test:1 5 3-3 -3 5 -5 1It should give "YES", but your code gave "NO"
•  » » » 5 days ago, # ^ |   0 Oh thanks a lot <3 <3 <3
 » 5 days ago, # |   0 Why my code of problem D wrong answer on Test #3? Can someone tell me? Thanks!173220801
•  » » 5 days ago, # ^ |   0 me too bro
•  » » 5 days ago, # ^ |   0 try this case 1 5 4 1 200 -100 1 -100the answer should be NO, but your code gave YES
•  » » » 4 days ago, # ^ |   0 Thank you very much
 » 5 days ago, # |   +42 Dear MikeMirzayanov, Why are we penalized with a -50 for resubmission when the site goes down? I got -150 due to unwanted resubmission when the site went down.
•  » » 5 days ago, # ^ | ← Rev. 2 →   +3 Same here, I have submitted 4 exactly identical codes due to CF lagging and got -150 for that.
•  » » 4 days ago, # ^ |   0 Same with me !!
•  » » 4 days ago, # ^ |   0 Same, although I've submitted identical codes, I got -100.
 » 5 days ago, # |   +3 Can anyone give me a failing case for https://codeforces.com/contest/1734/submission/173197473
•  » » 4 days ago, # ^ |   0 Take a look at Ticket 16208 from CF Stress for a counter example.
 » 5 days ago, # | ← Rev. 2 →   +6 Good round but I didn't manage to write D:( can someone please give the failing testcase? I will be glad if someone could help me
 » 5 days ago, # |   +4 Dumbass me trying to use Fenwick tree for D...
 » 5 days ago, # |   +9 Because of the Website issues, In problem B the same code got judged twice and I got -100 so is there any solution or anyone got the same problem? 173177338173176654
•  » » 5 days ago, # ^ |   +11 Yes, I faced the same issue while submitting solution for problem A. it got submitted twice.
•  » » » 5 days ago, # ^ |   +11 The same.I also submitted A twice.
•  » » 5 days ago, # ^ | ← Rev. 2 →   +3 Same, i got -150 for unwanted resubmission of B.
•  » » 5 days ago, # ^ |   +3 I faced the same thing while submitting a I got 8 WA in 1 second.
•  » » » 5 days ago, # ^ |   0 sad:'( I hope this issue will be solved ISA
 » 5 days ago, # |   +1 i've done the solution for D and it passed the sample tests but i ran out of time and couldn't submit , i hope it gets WA after the system tests because i'd be so mad if it got AC
•  » » 5 days ago, # ^ |   0 How you did C ?
•  » » » 5 days ago, # ^ |   0 I tried to do something like this but it was brute: #include using namespace std; int main() { int t; cin>>t; while(t--){ int x,l,ans=0; cin>>x; string s; cin>>s; l=s.length(); vectorv(x+1,0),visited(x+1,0); for(int i=0;i
•  » » » 5 days ago, # ^ |   +4 it is the same idea of sieve of eratosthenes , iterate over the string and if the current number (let it be num) needs to be deleted the the i should iterate over the multiples of that number (let it be j) and take the minimum cost to delete that j which is min(mnCost[j] , num) i should break when j is multiple of num but j cannot be deleted from the set as i won't be able to do this deleting operation using this num in the future look at my code for more clarification
•  » » » » 5 days ago, # ^ |   0 It feels like C was much easier than B, it was so direct question...I felt like some data in B was missing they should have mentioned if the current room where we have reached is having torch than it will be counted too.
•  » » » » » 4 days ago, # ^ |   0 Yes it should have been mentioned, but you just have to see the test case and you will understand that the room is counted too
 » 5 days ago, # |   +4 https://youtu.be/bOizr3O0elAThis channel posted correct solutions of A & B during the contest and many participants would have seen this. Due to this, the rankings would be skewed and would lead to an unfair contest, please do something regarding this.
•  » » 5 days ago, # ^ |   -12 Plag check wouldn't be reliable in problem A & B to eliminate those who copied either. Probably making it unrated should be considered as those videos have 500+ views.
•  » » » 5 days ago, # ^ |   +1 Eh bad for you that the video was published after the contest
 » 5 days ago, # |   0 estimated rating of C?
•  » » 5 days ago, # ^ |   0 maybe 1100-1300
•  » » » 5 days ago, # ^ |   0 understandable, did u know why your E works before submitting?
•  » » » » 5 days ago, # ^ |   0 Nah, I do not have proof of why it works, I am not sure, even now why it is working
•  » » » » » 5 days ago, # ^ |   0 then how did it strike u that that could be the solution lol?
•  » » » » » » 5 days ago, # ^ |   0 Actually i dry run this on sample test cases and it is working fine, but I do not have the exact idea why it works for every test case. it is a kind of hit and trial.
•  » » » » » » » 5 days ago, # ^ |   0 oh ok
 » 5 days ago, # |   0 Can this submission for problem F be hacked?
 » 5 days ago, # | ← Rev. 2 →   0 Hi, can someone help me understand why this submission gives TLE, isn't the complexity nlogn? https://codeforces.com/contest/1734/submission/173206247 Got it. It was due to resizing on 10^6 every time.
 » 5 days ago, # |   0 I am a shit and I didn't solve C,though C is very easy.
•  » » 5 days ago, # ^ |   0 Bro what will be the expected rating of that question I did solved it in last minute
•  » » » 5 days ago, # ^ |   0 ig it would be 1200-1300 since its looks like typical div2b and too many people solved it lol maybe even 1100
 » 5 days ago, # |   +2 This Ame-wiki guy were in my room-213..when I was going to see his/her code at contest time. I was shocked!! Just try to unserstand what those line indicate.... Submissions are:1734A1734B1734C1734EI think to makes code unreadable to others is nothing but scam..
 » 5 days ago, # |   -47 I get very angry because of the time of this round.I turned on my computer at 22:15(utc+8) and it is already over.It's a good idea to put off it. But U chose to make it earlier. That's one of the worst decisions U can make.
•  » » 5 days ago, # ^ |   -18 it's unrated for you, what's your problem?!
•  » » » 5 days ago, # ^ |   0 It doesn't matter. I don't care whether it is rated. I only want to enjoy the process of competing. But I can't today.
•  » » » » 5 days ago, # ^ |   -13 There's an option which is virtual participation, You can do it any time in the year !!!!!!
•  » » 4 days ago, # ^ |   +3 I thought someone would comfort me. But just downvotes.
 » 5 days ago, # | ← Rev. 2 →   -45 :/
•  » » 5 days ago, # ^ |   0 Yeah I dead at A
•  » » 5 days ago, # ^ |   +6 Well you also cheated in D so why are you so angry?
•  » » 4 days ago, # ^ |   +6 So you cheated in this round Right? If so you have no qualification to complain it bro（I just think your code of D is very suspicious,if you didn't,I'm sorry.)
•  » » » 4 days ago, # ^ | ← Rev. 2 →   0 :/
 » 5 days ago, # |   +14 nice problems! orz arvindf232, happypotato1207 and nicholask
 » 5 days ago, # |   +1 why the fuck am I missing D by an inch every single contest !!!
•  » » 5 days ago, # ^ |   +1 same. I didn't submit my D in contest thinking it'll TLE, now submitting the same gave me AC.
•  » » » 5 days ago, # ^ |   0 D is basically two pointers with some painful implementation
 » 5 days ago, # |   +10 May I ask why the data range of problem C is $10 ^ 6$, but $O(N \sqrt{N})$ time complexity can pass? I can't understand it.
 » 5 days ago, # |   0 Why did this brute force code get AC after the system test? Is it wrong or right?
•  » » 5 days ago, # ^ |   0 I don't think that is brute force cuz it's pretty same as my code and I can prove it :vv
•  » » » 5 days ago, # ^ |   0 I optimized this code and proved the new one was right, so I think this is brute force. So how to prove this code is right? Thanks a lot.
•  » » » » 5 days ago, # ^ |   0 The code is way too long and complicated so I just view it fast and get the main idea (hope it not gone wrong :vv)Just start from k and then go left until got a better choice than the current then update to that point, if it invalid then do the same to the right and if it invalid then print no otherwise if get to 0 or n + 1 then yes(Sorry for my bad English and knowledge :<<)
•  » » » » » 4 days ago, # ^ |   0 Oh, I know its correctness, but I wonder if it's time complexity is right (Why didn't it get TLE?).
•  » » » » » » 4 days ago, # ^ |   0 Because you start at k and then go for a better choice, if it exist on the left then update if not check the right and update (pretty same as 2 pointers but instead of pointing from the outer to k now we spread from k to the outer) so the time complexity is just O(n)
•  » » » » » » » 4 days ago, # ^ |   0 But while it go to the left, the right also cost time. If there is a situation that every time it go to the left one step and need to check the right in $\mathcal O(n)$ time, it will cost $\mathcal O(n^2)$ time.(Sorry to my poor English)
•  » » » » » » » » 4 days ago, # ^ |   0 No, just go to the left and if the slime can get bigger then update l (considered as the id of the left) and the slime, if the slime got negative then go to the right then update r (considered as the id of the right) and the slimeYou just update when you meet the case that you got a bigger slime or negative slime when you go all the way to the left or right so it cost only linear time
 » 5 days ago, # |   0 How can I view the 2839th token of problem D test 3?Or could someone tell me where's wrong in my solution :(
•  » » 5 days ago, # ^ |   +1 keep track of each testcase and print the respective testcase in string.
•  » » » 5 days ago, # ^ |   0 it works, thank you! :D
•  » » » » 4 days ago, # ^ |   0 Hey, did you figure it out? My 173295588 failed 2839 also. I tried to print the input but only saw "wrong output format YES or NO expected, but [-2, found [2839th token]"
•  » » » » » 4 days ago, # ^ |   0 Take a look at Ticket 16212 from CF Stress for a counter example.
•  » » » » » » 4 days ago, # ^ |   0 I tried for 173364548 but it shows "An error occurred while downloading your submission. Probably Codeforces is down. "
 » 5 days ago, # |   0 Can anyone please check why my code is failing on pretest 3 173225741
•  » » 4 days ago, # ^ |   0 Take a look at Ticket 16209 from CF Stress for a counter example.
•  » » » 4 days ago, # ^ |   0 Thanks!
 » 5 days ago, # | ← Rev. 3 →   0 Why my code of problem D wrong answer on Test #3 [60th token] ? Can someone tell me? Thanks! https://codeforces.com/contest/1734/submission/173229017
•  » » 4 days ago, # ^ |   0 Take a look at Ticket 16210 from CF Stress for a counter example.
 » 5 days ago, # |   0 Can Someone explain me the time complexity of problem C? What will be the expression in big O notation?I thought it will give TLE but it didn't ╰(*°▽°*)╯
•  » » 5 days ago, # ^ | ← Rev. 2 →   +1 nlogn because (n/1)+(n/2)..........+(n/n) = n{(1/1+1/2....+1/n)}=nlognharmonic sum
•  » » 5 days ago, # ^ |   0 You are a good question
 » 5 days ago, # |   0 Problem D video Editorial
•  » » 3 days ago, # ^ |   0 Nice Editorial. Thanks!!
 » 5 days ago, # |   0 It was a great round
 » 5 days ago, # | ← Rev. 2 →   0 Why my solution of C is getting TLE. Can anyone tell me please? Isn't it supposed to pass? https://codeforces.com/submissions/tanvir942316
•  » » 5 days ago, # ^ |   0 It might be because you are doing too much map access, I once got TLE on a problem because I used map for frequency instead of a using normal array and set the elements of the array to zeros.anyway I changed map into array, and I moved the main array to global variables because your array size was only $2*10^5$ but it reached $10^6$ in the problemYour modified solution
 » 5 days ago, # |   0 Estimated rating of D anyone?
•  » » 4 days ago, # ^ |   0 It will be of 1700-1800 I guess
 » 4 days ago, # |   0 PLS write 2 days/ 1 contest
 » 4 days ago, # |   0 I didn't play well in this contest, so I hope I can cheer up in the next consest. ^_^
 » 4 days ago, # |   +3 I’m leavin' my name here 'cause it’s the first contest I participated in. And I even got a rating rise!
 » 4 days ago, # | ← Rev. 2 →   +60 Is it confirmed that GOI_Official is an individual participant? I find it quite incredible that they solved ABCDE all within a span of fifteen minutes. This includes a submission at 9m12s for D (WA test 3), followed by the first submission for C at 9m50s (AC) and then a second submission for D (AC) at 10m41s. This really gives me the impression that it likely involved at least two programmers coding in parallel. There is also a slight inconsistency in their submission formatting. Submissions for A and D (173165060 173171017 173172113) include a header with the problem names and links, but these are missing in the submissions for B, C, E, and F (173169227 173171420 173175699 173185632). All submissions have the following two lines: //author: wuge with noi2022 cu //https://www.luogu.com.cn/team/48234 I would guess that noi2022 refers to a National Olympiad of Informatics (CU might be the institution?), which generally involves a team (wuge might be the team name?), and the link below (which seems to be inaccessible in my region) has "team" in its url. If it is the case that this user is actually representing a team, where different members of the team were able to code in parallel, I don't think this is within contest regulations (which required the user to register "as an individual participant"), so they should not be included in the official standings then. Of course, I don't know for sure that the user represents a team, but I think this should be investigated.
•  » » 4 days ago, # ^ |   +22 In fact Wuge seems to be a CPer's name,And in NOI2022,he actually got the bronze medal.I agree on your guessing,I think two CPers worked together,and one solved AD,another solved BCEF.
•  » » 4 days ago, # ^ |   +8 U R probably right. It's imposisible to code at such a speed.They may share something, including read() and main() and the name of function meyi()`. But A&D have a header. That is different. The time is also strange.GOI is a team. They hold a contest in luogu(a famous OJ in China), and it turned out to be a mess.
 » 4 days ago, # |   +10 Why do we care for codechef:(
 » 4 days ago, # |   0 I can solve problems A, B and C in div 2 most of the times now. Any suggestions on how can I solve problem D?
 » 4 days ago, # |   0 Why not unrated?
 » 4 days ago, # |   0 asghar dar kamin ast!!!!! asghar is lurking!!!!!! Асгар в бегах!!!!!!
 » 4 days ago, # |   0 Hello, why does my submission give TLE? 173310975
 » 4 days ago, # |   0 Hey, I am kinda stuck on Problem C with my solution. My Approach:Take two sets A and B, both maintains the numbers to be deleted from the set.Set A is ordered and B is unordered.Now for each element of A say X, first I find its smallest possible multiple in B say M. And then check from X to M, I check whether the multiples in b/w are given as 0 or 1 in the string. If it is a 1 somewhere then I take the next element from A. If no 1 is found, then I delete all the possible multiples of X starting from M and the same is done till either we reach the end of A or B becomes empty.This approach somehow is failing on 512th number on Test Case 2.I am not able to figure out what exactly is going wrong.173315698
•  » » 4 days ago, # ^ |   0 Take a look at Ticket 16211 from CF Stress for a counter example.
•  » » » 4 days ago, # ^ |   0 Thanks buddy, I will give it a look and see what's wrong.
 » 3 days ago, # |   0 I did not copy any solution and then too system tells that I copied and my rating did not increase, what should I do now?