Merge branch 'master' of https://github.com/thecodingwizard/usaco-training-2.0
was working on DP uhoh
This commit is contained in:
commit
c6b958a365
4 changed files with 13 additions and 8 deletions
|
@ -28,10 +28,10 @@ In general, we recommend the following:
|
|||
- For Bronze contestants, any of C++/Java/Python will do.
|
||||
- If you know multiple languages, we recommend you pick C++ over Java, and Java over Python.
|
||||
- For Silver, Gold, and Platinum, we recommend C++/Java.
|
||||
- If you know multiple languages, we recommend you pick C++ over Java since C++ is faster.
|
||||
- It's not guaranteed that you can receive full points for every problem using Python (even for Silver).
|
||||
- If you know multiple languages, we recommend you pick C++ over Java.
|
||||
- Python and Java have trouble passing time limits even for Silver despite the x2 multiplier.
|
||||
- Rewriting the C++ solution for [Wormsort](http://www.usaco.org/index.php?page=viewproblem2&cpid=992) in Python gets TLE on 2/10 cases.
|
||||
- A similar solution in Java requires almost 3s (for a time limit of 4s)
|
||||
- A similar solution in Java requires almost 3s, which is fairly close to the time limit of 4s.
|
||||
|
||||
Note: A majority of high level contestants use C++ and Java. Between those, C++ is more popular.
|
||||
|
||||
|
|
|
@ -23,7 +23,7 @@ order: 2
|
|||
|
||||
<!-- END DESCRIPTION -->
|
||||
|
||||
(from github)
|
||||
(from my github)
|
||||
|
||||
* Types
|
||||
* Set, Multiset, Unordered Set
|
||||
|
@ -33,7 +33,6 @@ order: 2
|
|||
* Priority Queue (Heap)
|
||||
* Vector
|
||||
* Stack
|
||||
* Bitset
|
||||
* Tutorial
|
||||
* CPH (4, Data Structures)
|
||||
* [C++ Reference](http://www.cplusplus.com/reference/stl/)
|
||||
|
@ -45,3 +44,6 @@ order: 2
|
|||
* [Mahmoud & Ehab & Function](http://codeforces.com/contest/862/problem/E) [](74)
|
||||
* [Karen & Cards](http://codeforces.com/contest/815/problem/D) [](86)
|
||||
* [Tournament](http://codeforces.com/contest/878/problem/C) [](106)
|
||||
|
||||
|
||||
[Blowing up Unordered Map](https://codeforces.com/blog/entry/62393)
|
|
@ -19,3 +19,7 @@ order: 3
|
|||
See 8 of https://www.overleaf.com/project/5e73f65cde1d010001224d8a
|
||||
|
||||
See 12 of https://www.overleaf.com/project/5e73f65cde1d010001224d8a
|
||||
|
||||
|
||||
- [Breaking Java Arrays.sort()](https://codeforces.com/blog/entry/4827)
|
||||
- no longer works, see [this one](https://codeforces.com/contest/1324/submission/73058869) instead
|
|
@ -113,4 +113,3 @@ You can also use shortest path algorithms to solve the following problem (a very
|
|||
- [Art](https://codeforces.com/gym/102394/problem/A) (basically same as above)
|
||||
- [Timeline (Camp)](https://probgate.org/viewproblem.php?pid=524&cid=80)
|
||||
- equivalent to [Timeline (Gold)](http://www.usaco.org/index.php?page=viewproblem2&cpid=1017) except negative values of $x$ are possible.
|
||||
- [Truth Telling (Camp)](https://probgate.org/viewproblem.php?pid=378)
|
Reference in a new issue