YoungForest's blog

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)111 / 5333YoungForest181:11:490:11:56 10:21:44 10:37:271:01:49In this contest, because of carelessness, I forgot to consider the corner case in the first problem: the permutation count of 0 is 1. In the second problem, I simply reversed upper and lower

This week I went to ByteDance to attend the summer camp, and still had classes on Sunday, so I skipped the weekly contest. Then how could I participate in Kick Start? After all, this month’s Round E was the so-called golden round, important for getting interview slots, so I chose to skip the summer

Cherries Mesh Minimum spanning tree. Pay special attention to the Union-Find implementation: find must use path compression to achieve O(1). Otherwise it will time out. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 4

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)106 / 1901YoungForest181:01:130:05:460:27:130:35:341:01:13This week I attended ByteDance’s summer camp. The opening ceremony was on Saturday, so I completed this biweekly contest from the bed in a five-star hotel. It was wonderfully comfortable, and th

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (7)476 / 5091YoungForest191:31:130:03:520:09:231:16:13 20:50:16 1The result of this contest was poor again, with a rank in the 400s. The direct reason was that I spent too much time on search pruning for the third problem and did not get it right in one s

RankNameScoreFinish TimeQ1 (4)Q2 (5)Q3 (6)Q4 (9)476 / 5091YoungForest151:00:140:10:210:42:141:00:14nullAshamedly, my ranking fell back to 400+. I had half an hour to solve the last problem and kept trying to use a segment tree. Just like Kick Start Round D, I got obsessed with segment trees and cras

RankNameScoreFinish TimeQ1 (4)Q2 (5)Q3 (6)Q4 (8)77 / 5319YoungForest230:56:450:09:510:24:020:41:200:56:45This contest was my first time entering the top 100 again after three months, and it was also my second consecutive top-200 finish, so I was a little happy. It swept away the gloom from last week

RankNameScoreFinish TimeQ1 (2)Q2 (5)Q3 (7)Q4 (7)175 / 4906YoungForest211:14:320:08:18 10:27:17 10:41:321:04:32Yesterday I did the Biweekly Contest, and today I did the regular contest plus Google Kick Start Round D in the afternoon. Three contests in a row made for a very full weekend. 1137. N-th T

Rank: 765 / 1866. X or What This problem is about finding patterns and tests one’s familiarity with xor. In fact, I had once been very close to the correct solution. But I was fixated on my past experience solving interval problems with segment trees, trying to figure out what information each node

RankNameScoreFinish TimeQ1 (3)Q2 (3)Q3 (5)Q4 (7)98 / 1634YoungForest180:35:230:11:010:10:530:22:400:35:23It had been two months since I last participated in a biweekly contest, and the number jumped directly from 1 to 5. This contest was very simple. All the problems were classic algorithm problems