### atcoder_official's blog

By atcoder_official, history, 4 weeks ago,

We will hold Tokio Marine & Nichido Fire Insurance Programming Contest 2024（AtCoder Beginner Contest 355).

We are looking forward to your participation!

 » 4 weeks ago, # |   0 Hoping to solve ABCD!!
 » 4 weeks ago, # |   +23 There is a strange bug on the homepage of ABC355. If you're in English mode, when you enter the page, your browser begins playing music; after that, there will be some Japanese introduction to this company.I found that the problem was caused by the video on the homepage (in Japanese mode), and the solution is to ban your browser from automatically playing media on the page. And I hope AtCoder can fix it. This is not a big problem, but sometimes it's annoying.
•  » » 4 weeks ago, # ^ |   +26 i just got a heart attack
 » 4 weeks ago, # |   0 i think problem D is close to this problematcoder's solutioncodeforces solutionthe only difference is that codeforces's problem one interval should contains the other.
 » 4 weeks ago, # |   0 Misread B :)Btw, how to solve F? Does it involve link-cut trees?
•  » » 4 weeks ago, # ^ |   0 this can be extended easily for F
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   0 maybe yes , I just opened cf 5 minutes before the contest ended and saw a blog come up on MST query. I saw a GM explaining to use link cut trees. I started to read it and knew it was not of my cup of tea at least for my level.LMAO
•  » » 4 weeks ago, # ^ |   0 I solved it with basic Kruskal's algorithm, by looking at the constraints.
•  » » » 4 weeks ago, # ^ |   0 please elaborate
•  » » » » 4 weeks ago, # ^ |   0 If one Kruskal doesn't solve the problem use 10 of them
 » 4 weeks ago, # |   0 found very difficult.
 » 4 weeks ago, # |   0 My idea for problem-E using dp find the minimum no of moves to reach from L to R, then get the path. I'm getting WA.
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   0 i did not read your code, but you took into consideration right that we can also add and reduce values not in range L-R for example if 1-7, we can add 0-7 and sub 0-0?
•  » » » 4 weeks ago, # ^ |   0 shit, NO!! now it becomes more complicated.
 » 4 weeks ago, # |   0 SpeedCoder?
 » 4 weeks ago, # |   +3 Anybody missed reading the constraint on weight in F and then waste time?
•  » » 4 weeks ago, # ^ |   0 So do I.
•  » » 4 weeks ago, # ^ |   0 Yes. But i just dropped the problem after reading
•  » » 4 weeks ago, # ^ |   0 Me too, is there a Link-Cut Tree solution to it?
•  » » » 4 weeks ago, # ^ |   0 Actually there is, but would you like to really write it...
 » 4 weeks ago, # |   +116 Cool.
•  » » 4 weeks ago, # ^ |   0 Cool.
•  » » 4 weeks ago, # ^ |   0 he/she needs only a minute to finish four problems!? That's really insane, and also suspicious.
•  » » » 4 weeks ago, # ^ |   0 Maybe I don't get something, but it took him 51 minutes to solve ABCD?
•  » » » » 4 weeks ago, # ^ |   +36 That's 51 seconds.
•  » » » » » 4 weeks ago, # ^ |   0 Oh, thanks, didn't know that))
•  » » » 4 weeks ago, # ^ |   0 No, they just have a really good gaming chair.
•  » » 4 weeks ago, # ^ |   -10 Is there any extension for atcoder as well which predicts rating change ?
•  » » 4 weeks ago, # ^ |   +11 I checked toyuzuko's contest history. Their last contest was ABC354 and they solved ABCE in less than 2 minutes, but they registered as unrated and didn't get reported. I didn't find any abnormal contests before that.maroonrk could you please figure this out
•  » » 4 weeks ago, # ^ |   0 Cool.
•  » » » 4 weeks ago, # ^ |   0 Insane dude.
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   -10 Cool.
•  » » » 4 weeks ago, # ^ |   0 Another conjecture is that he may have used very intelligent AI due to some unnecessary annotations.
•  » » 4 weeks ago, # ^ |   +9
•  » » 2 weeks ago, # ^ |   0 It's quite interesting (and suspicious?) that they also added comments to their code...it implies that they weren't rushing, yet they solved all the problems almost immediately??
 » 4 weeks ago, # |   0 Is there any other solution apart from link-cut tree? I didn't know about link-cut tree so did a brute force kind of solution. I processed initial N-1 edges from lowest weight to highest weight. For each weight, I maintained connected component data using DSU. Then for each additional edge of weight W to add, I checked if nodes U, V are in same component at DSU of weight W. If they are that means, an edge with weight <= W has connected components of these two nodes so the incoming edge can't replace any edge in MST.If they are in different components, then that means, components to which U, V belong are connected by some higher weight edge and incoming edge can replace heavier edge in MST and update MST edge weight and then do union for U, V for all edge weights greater than or equal to W.I got an AC with this approach but not sure if this approach is correct as everybody is mentioning link-cut tree. Can someone confirm if this is correct?
•  » » 4 weeks ago, # ^ |   0 Confirmed by AC and few comments above
 » 4 weeks ago, # |   0 Why does this solution to D gives WA (https://atcoder.jp/contests/abc355/submissions/53878525)
•  » » 4 weeks ago, # ^ |   0 Got it I used int ans instead of long long int ans :(
 » 4 weeks ago, # | ← Rev. 2 →   0 For problem E, is there any intuitive understanding about the definition of S(x,y) = -S(y,x) when x > y.I wonder how could someone come up with this definition and construct a graph.
 » 4 weeks ago, # |   0 When will the Editorial in English be available?