| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 299 / 11282 | YoungForest | 18 | 1:16:19 | 0:05:09 | 0:18:06 | 0:29:04 | 1:11:19 1 |
Greedy. Analyze each digit’s situation and solve it with if-else.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 331 / 9692 | YoungForest | 18 | 2:02:29 | 0:05:32 | 0:13:55 2 | 0:54:53 2 | 1:17:29 5 |
Greedy. Sort boxes by capacity from large to small, then use the larger boxes first.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 573 / 6631 | YoungForest | 12 | 0:51:14 | 0:19:42 | 0:24:42 1 | 0:46:14 | Debugged it one minute too late. So annoying! |
Simulate the eating process described in the problem. In fact, because of the termination-condition check, the implementation is not that straightforward.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 231 / 8838 | YoungForest | 18 | 1:24:39 | 0:03:55 | 0:21:00 | 0:30:16 | 1:09:39 3 |
A warm-up problem. Use a set to record vowels, then count one by one.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 71 / 9827 | YoungForest | 18 | 0:48:21 | 0:03:32 | 0:05:23 | 0:12:14 | 0:43:21 1 |
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 has few tokens and simple settings, it can be handled in one pass by looking ahead to determine the token.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (6) | Q4 (7) |
|---|---|---|---|---|---|---|---|
| 356 / 9462 | YoungForest | 13 | 1:24:07 | 0:03:55 | 0:20:14 | 1:09:07 3 | null |
Warm-up problem. Sum an array; C++ accumulate handles it in one line.
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 a first draft of my year-end summary. I do not know whether the mood will affect it.
From the very beginning, 2020 was destined to be an extraordinary year. Before, I had only foreseen that because I was going to graduate, it would be extraordinary for me. I did not expect a pandemic sweeping the world to make it a challenging year for everyone.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 862 / 9573 | YoungForest | 18 | 0:58:34 | 0:12:47 | 0:23:33 | 0:33:14 | 0:58:34 |
Previously 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, I only solved three problems. This week I solved four problems, but fell outside the top 500. Now I have to check in for another week. My ranking in the Cruel group also dropped to 38, no longer the peak days of rank 15.
Since full-time recruiting ended, and because my internship and thesis have been especially busy, I have had no time to practice problems. Even during the busiest period before submitting my thesis format review, I did not solve a single problem. Since November, I have resumed the habit of doing the daily problem on both the Chinese and US LeetCode sites. Mainly because these two problems are usually relatively easy and take little time. Another reason is that I want to check in and earn points, trying to exchange for two sets of clothes before graduation.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 362 / 9683 | YoungForest | 12 | 0:35:02 | 0:04:21 | 0:13:42 | 0:30:02 1 | null |
Warm-up problem. Follow the problem statement and implement the interface with an array and a pointer.
| Rank | Name | Score | Finish Time | Q1 (3) | Q2 (4) | Q3 (5) | Q4 (6) |
|---|---|---|---|---|---|---|---|
| 688 / 6047 | YoungForest | 7 | 0:16:02 | 0:03:44 | 0:11:02 1 | null | 0:41:26 |
This 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 first two. For the third and fourth problems, I only tried brute-force solutions, but facts proved that although they were very close to the correct answers, they all TLEed.