https://codeforces.net/contest/1366/submission/83422255 In today's contest i was trying to solve a problem and i got re. Can anyone explain why?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 151 |
https://codeforces.net/contest/1366/submission/83422255 In today's contest i was trying to solve a problem and i got re. Can anyone explain why?
Name |
---|
It is really obvious from your memory consumption. It is a stack overflow. Imagine how many recursive calls you will do? Don't you think it is too much? I will give you a hint:
Imagine a stick is $$$X$$$ and a diamond is $$$Y$$$. You will need to minimize the sum of $$$X$$$ and $$$Y$$$ after you simultaneous subtract them. There are two methods of subtraction which will give you an emerald:
$$$X=X-1$$$,$$$Y=Y-2$$$
or
$$$X=X-2$$$,$$$Y=Y-1$$$
thanks
You're welcome!