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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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?
Название |
---|
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.me/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.me/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