Which algo should be used???? http://acm.timus.ru/problem.aspx?space=1&num=1220 problem is Memory limit exceeded here..
# | User | Rating |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | atcoder_official | 160 |
4 | Um_nik | 160 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 151 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
Which algo should be used???? http://acm.timus.ru/problem.aspx?space=1&num=1220 problem is Memory limit exceeded here..
Name |
---|
I haven't tried to solve it myself. Could you please elaborate more on what's your approach to see if we can point you in the right direction?
I m using stack[1001] stl here, but it shows memory limit exceeded...
stl stack (std::stack) uses too much memory. You should organize your own stack. I used my own linked lists. Eech node of the list contain 0..7 elements.
try to submit under Visual C++ 2010 if you are using G++.
is there any way to solve with standard C++ ??
I got AC half an hour ago with MS VS 2010 C++ compiler. The same code with G++ gets ML.