YoungForest's blog

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)299 / 11282YoungForest181:16:190:05:090:18:060:29:041:11:19 11736. Latest Time by Replacing Hidden Digits Greedy. Analyze each digit’s situation and solve it with if-else. 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 3

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)331 / 9692YoungForest182:02:290:05:320:13:55 20:54:53 21:17:29 55641. Maximum Units on a Truck Greedy. Sort boxes by capacity from large to small, then use the larger boxes first. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 class Solution { publ

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)573 / 6631YoungForest120:51:140:19:420:24:42 10:46:14Debugged it one minute too late. So annoying!1700. Number of Students Unable to Eat Lunch Simulate the eating process described in the problem. In fact, because of the termination-condition check, th

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)231 / 8838YoungForest181:24:390:03:550:21:000:30:161:09:39 35637. Determine if String Halves Are Alike A warm-up problem. Use a set to record vowels, then count one by one. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 class Solution { public: bool

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)71 / 9827YoungForest180:48:210:03:320:05:230:12:140:43:21 11678. Goal Parser Interpretation Warm-up problem. String interpretation. A general approach is to first do lexical analysis to get tokens, then translate them in sequence. Since this problem ha

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (6)Q4 (7)356 / 9462YoungForest131:24:070:03:550:20:141:09:07 3null1672. Richest Customer Wealth Warm-up problem. Sum an array; C++ accumulate handles it in one line. 1 2 3 4 5 6 7 8 9 10 class Solution { public: int maximumWealth(vector>& acc

Read more »

Reposted from my blog This year-end summary is a bit early; December has not even arrived yet. But since I just submitted the plagiarism check for my master’s thesis today, even though there are still many things to do, I have no mood to work at all. I might as well use this restless mood to write

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)862 / 9573YoungForest180:58:340:12:470:23:330:33:140:58:34Previously I had been exempt from checking in with the Cruel Problem Solving group for five consecutive weeks, which felt great for a whole month. Last week, although I ranked within the top 500

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)362 / 9683YoungForest120:35:020:04:210:13:420:30:02 1null5601. Design an Ordered Stream Warm-up problem. Follow the problem statement and implement the interface with an array and a pointer. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

RankNameScoreFinish TimeQ1 (3)Q2 (4)Q3 (5)Q4 (6)688 / 6047YoungForest70:16:020:03:440:11:02 1null0:41:26This week’s biweekly contest was still quite difficult. Although the point values were 3/4/5/6, I think the third and fourth problems were worth more than 5/6 points. Of course, I only solved the