a/usaco-guide
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Merge branch 'master' of https://github.com/thecodingwizard/usaco-training-2.0

Browse source
This commit is contained in:
Nathan Wang 2020-06-06 17:00:59 -07:00
commit a7c46a4524
2 changed files with 25 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

30
content/0_Intro/4_Intro_ReadingEditorials.md
View file

@ -1,7 +1,7 @@
---
slug: /intro/reading-editorials
title: When to Read Editorials
author: Nathan Wang
title: When to Read Editorials (Analyses)
author: Benjamin Qi, William Lin, Eric Wei, Nathan Wang, Nathan Chen
order: 4
---
@ -10,20 +10,27 @@ is challenging. Below are the opinions of various individuals.
<!-- END DESCRIPTION -->
Note that "give up" is in quotes, because one still learns when they "give up"
and read an editorial!
Note that "give up" is in quotes, because one still learns when they "give up" and read an editorial!
## Benjamin Qi
> I usually read editorials after 1 second, so I can find what wrong solution the authors have because if I can't solve a problem in 1 second it's broken
If you're still coming up with new ideas, keep thinking. Otherwise, you have several options:
- Look at [part of] the solution. (If CodeForces, look at the tags.)
- Leave it for a while and do something else if you actually want to solve it on your own.
- Get a hint from someone else.
/s
I'm impatient, so usually I go with the first option. Sometimes I end up reading an editorial before reading the statement, but idk if this is a good strategy. :/
@benqorz
In any case, if you thought about a problem a lot during a contest but didn't end up solving it, then I don't see any reason not to read the editorial when it comes out (vs. continuing to think about it on your own). Also, you should always implement the solution afterwards!
## William Lin
@tmworz
> I follow three guidelines (from most important to least important)
> 1. Having fun, just doing whatever you feel like doing
> 2. Spend about the same amount of time that you would be able to during a real contest
> 3. Whether you are making progress or not
Feel free to not listen to William Lin's suggestions as he is not very good himself.
## Eric Wei
@ -56,4 +63,9 @@ My justification for why I think it's okay to give up so early is as follows:
- In other words, reading editorials is a _good_ thing, not a bad thing!
Overall, I would just say to "give up" when you feel like giving up, whether that's
in five hours or in 15 minutes :)
in five hours or in 15 minutes :)
## Nathan Chen
Read the editorial when you feel like you've stopped making progress; that could be from 1 to 5 hours. However, the most important part about reading the editorial is that you understand the topic and try to think about what similar problems look like. Being generally curious is a good way to practice algorithmic thinking.

5
content/0_Intro/5_Intro_Resources.md
View file

@ -9,6 +9,8 @@ Helpful Links!!
<!-- END DESCRIPTION -->
Use [clist.by](https://clist.by/coder/bqi343/) to track your progress!
### Lists
* [USACO Resources Page](http://www.usaco.org/index.php?page=resources)
@ -19,6 +21,7 @@ Helpful Links!!
* [Competitive Programmer's Handbook (CPH)](https://cses.fi/book/book.pdf)
* The [problemset](https://cses.fi/problemset/) (now at 200 problems) is quite good!
* [Guide to Competitive Programming](https://www.amazon.com/Guide-Competitive-Programming-Algorithms-Undergraduate/dp/3319725467) is a paid book based off CPH
* Can currently download PDF [for free](https://link.springer.com/book/10.1007/978-3-319-72547-5)!
* Competitive Programming Book (Steven, Felix)
* [Competitive Programming Book 1](http://www.comp.nus.edu.sg/~stevenha/myteaching/competitive_programming/cp1.pdf) is freely available but old
* [Competitive Programming 4](https://cpbook.net/) is the latest edition of the book (with significant additions) but costs money.
@ -30,7 +33,7 @@ Helpful Links!!
### Courses
* [Competitive Programming Course (SuprDewd)](https://github.com/SuprDewd/T-414-AFLV)
* [Algorithms Pt 1 (and Pt 2)](https://www.coursera.org/learn/algorithms-part1)
* [Cousera Algorithms Pt 1 (and Pt 2)](https://www.coursera.org/learn/algorithms-part1)
* [Carnegie-Mellon ICPC](https://contest.cs.cmu.edu/295/f17/)
* [VPlanet](https://vplanetcoding.com/)