# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
Name |
---|
Python + Recursion = B A D (Reason ~ link).
Stack Overflow will happen in the case of a linear graph of 10^6 size. What can you do :
1.Use Any Other Language as you did already.(CPP ;-))
2.Use Threading and sys.setrecursionlimit(10**6) as I did (Modified your code and got AC).(69799972).
Example code to increase recursion limit and max stack size in Python.
Although it is not recommended since it gives MLE in many cases. Not mine
Python + any kind of heavy object handling = bad, and a function call is also an object. Python + C modules for heavy computation = perfectly fine.
Check out Python bindings for C libraries. When anything from a module implemented in C is used in Python, there are sooo many checks and conversions, everything is wrapped in a
PyObject*
and it's just way too costly. If you avoid these kinds of costly things, e.g. with Numpy array manipulation (=implemented in C) or JIT, working with large data can still be pretty fast.