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?
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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
| 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://mirror.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://mirror.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