online-judge.uva.es

by **liulike** » Mon Nov 20, 2006 10:39 am

(Although it hasn't been available) In the last contest, I got MLE again and again for it. I used a set and a fixed size stack to implemet it, and destructor to release the memory recursively. What's the trick for it? Is there better implement? Thank you!

by **shahriar_manzoor** » Mon Nov 20, 2006 11:11 am

Those problems won't be available here. You will find then in CII live archive or just follow the link

http://acmicpc-live-archive.uva.es/nuev ... &year=2006

by **little joey** » Mon Nov 20, 2006 8:28 pm

I changed the title of this thread, because 11049 will be used for an other problem soon.

The problemset was top quality! Those guys at KTH know how to make a great contest.

by **shahriar_manzoor** » Mon Nov 20, 2006 11:40 pm

Yes I also liked some of the problems very much. Especially the Airport one

.

by **sohel** » Tue Nov 21, 2006 1:09 pm

Little Joey wrote:The problemset was top quality! Those guys at KTH know how to make a great contest.

I agree. Well, they have got Per Austrin in their ranks. So the problemset has got to be good and balanced.

by **Per** » Wed Nov 22, 2006 10:56 pm

Thanks, nice to hear you liked the problems. To clarify, the jury consisted of some of the best people from all over the region. I was actually the only one from KTH.

Out of curiosity, did anyone watch the webcast? If so, what did you think of it?

online-judge.uva.es

NWERC: The SetStack Computer

NWERC: The SetStack Computer

hmm

hmm

hm..

Who is online