Let's solve some hard problems!
source link: http://codeforces.com/blog/entry/98630
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Tonight, I will pick twelve 3000 rated problems I haven't solved yet, try solving them, and track my progress. As usual, I will not look at editorials. Hopefully I will be able to solve them all before the year ends. I will not make this my highest priority and I won't try too hard. I will keep solving other problems in the meantime.
The problems are:
11 days ago, # |
Good luck!
Thank you for sharing, I will try the same problems in the following days/weeks and will keep this comment updated with those I solve.
- Problem 2: Solved in the past.
- Problem 3: Solved on the 4th of January. Challenge: solve the problem for n≤5000n≤5000. Comment (in white): I read balbit's comment and I disagree with him. For me this was clean, nice and hard dp problem. My implementation is straightforward, but I had to think a lot (and my first solution was wrong).
- Problem 4: Solved on the 4th of January. Comment: My solution is O(nq) and gets accepted without any optimization.
- Problem 7: Solved on the 5th of January.
- Problem 1: Solved on the 5th of January. Comment: This one is cool. The hardest for me among the ones I have solved.
- Problem 5: Solved on the 5th of January. Comment: Not very interesting problem. The question is interesting, the solution not so much. My solution is different from the official one and I had to suffer to reduce enough the number of queries.
- Problem 6: Solved on the 5th of January.
- Problem 9: Solved on the 5th of January. Comment: Coming up with the dp is easy, implementing it and optimizing it not so easy. I did not like this one, not recommended.
- Problem 8: Solved on the 6th of January.
- Problem 11: Solved on the 6th of January.
- Problem 12: Solved on the 6th of January. Comment: I don't see the point of this kind of problems: a greedy (which is screaming greedy) which involves a gazillion cases. One day I'll start appreciating these kind of problems, or at least I'll learn how to solve them in a reasonably short amount of time.
11 days ago, # |
Funnily enough, there is a Prime New Year Contest right now ;) You can try your luck there as well, I always have a lot of fun with it
11 days ago, # |
Look at his heatmap! :-O
Looks fun! I'd like to join too.
Problem 1: Solved Jan 5
Fun-ness:
Problem 3: Solved Jan 5
Fun-ness:
Problem 4: Solved Jan 5
Fun-ness:
Problem 5: Solved before
Problem 6: Solved Jan 7
Fun-ness:
Problem 7: Solved Jan 6
Fun-ness:
Problem 8: Solved Jan 6
Fun-ness:
Problem 9: Solved Jan 10
Fun-ness:
Problem 10: Solved Jan 8
Fun-ness:
Problem 11: Solved Jan 10
Fun-ness:
Problem 12: Solved Jan 10
Fun-ness:
I'd like to join too.
I copied this one to another website. However, I do not have enough time, so maybe I can't solve them in a short time. And maybe I will read the solutions.
Good luck!
UPD: It seems the problems maybe too hard for me, maybe I can't solve them, but I will try my best.
Thank you for the post, this is a great idea and I'm in! ;) I will split the problems into 3 categories.
Main category:
Problems from contests I have not virtually participated in before this post. Will do so when I have time:
Problems I solved before:
Problem 5: Upsolved after a virtual contest.
Problem 7: Upsolved after a contest.
Problem 8: Solved on a contest.
Problem 12: Solved on a virtual contest.
-
Done with the challenge. I had a lot of fun, thanks again to ivan100sic and all fellow solvers! It was cool reading the comments of the others after solving the problem. Would be glad to join something like this again in the future :)
3 days ago, # |
533A Rated 3000 !!!!!!!!!!!!!!!!!!!!!!!!!!
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK