On Ideone my code ran correctly for the first two Test Cases(Couldn't check for more):
But on Codeforces it's showing Runtime Error for the first Test Case.
Can anyone help?
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
On Ideone my code ran correctly for the first two Test Cases(Couldn't check for more):
But on Codeforces it's showing Runtime Error for the first Test Case.
Can anyone help?
Name |
---|
The return code of the first test of your submission suggests a stack overflow. Try using ints instead of long long ints.
I have used int everywhere.
I'm looking at http://codeforces.com/contest/983/submission/38822395
These occupy 3*5010*5010*sizeof(long long) bytes, which is approximately 574MB. But the stack size is only 256MB (see https://codeforces.com/blog/entry/79). So even if you use int instead of long long, you will need 574/2 = 287 MB, which is still to much.
Try to reuse the matrix f and use int instead of long long