3 Comments to “SPOJ 1484. Search in XML”

1. Xiaolong Li

   February 8, 2013

   Hi Xiaodao, I am a fan of you for a long time /$:^@^ I tried to solve this problem on SPOJ using Python but I constantly get TLE /$:/~ I think my recursive algorithm just runs linear time, which is probably what you mean by brutal search, so is it possible that the time limit for this problem, 3s, is too short for Python? /$:0o0 I see from the statistics that your C++ code takes around 2s and Python is much slower than C++. Could you please give me some suggestions? Any help will be grealy appreciated! /$:owo

2. xiaodao

   February 11, 2013

   .. . Hi, I think use python to solve this kind of problem is impossible in some sence … /$:^ ^ ( although I didn’t try by myself on this problem yet … ) .. There are some Online Judge set time limit to different language with different factor such as CodeChef … But not for spoj. I am looking foward weather there could be some one who can solve it with Python or any other interpreted language.~~

3. Xiaoqin

   February 7, 2014

   算法的link是空的，请问是删除了吗？

Leave a Comment