12105 - Bigger is Better

All about problems in Volume 121. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Post Reply
aminallam
New poster
Posts: 39
Joined: Thu Dec 08, 2005 12:51 pm
Location: Suez, Egypt.

12105 - Bigger is Better

Post by aminallam »

I wonder, where are the problems of the last 'hard' contest? And where is the forums related to it? I like to try submitting the problem 'Bigger is Better'.
I have made a very fast code. I made a dynamic programming approach using C++ code, that is very fast on my machine. (but got TLE)
I will be happy if someone tells me some optimization tricks for this problem?
Last edited by brianfry713 on Tue Aug 26, 2014 9:20 pm, edited 2 times in total.
Reason: thread title

mf
Guru
Posts: 1244
Joined: Mon Feb 28, 2005 4:51 am
Location: Zürich, Switzerland
Contact:

Re: (The hard contest) Bigger is Better

Post by mf »

aminallam wrote:I wonder, where are the problems of the last 'hard' contest?
Here:
http://acmicpc-live-archive.uva.es/nuev ... &year=2006

aminallam
New poster
Posts: 39
Joined: Thu Dec 08, 2005 12:51 pm
Location: Suez, Egypt.

Post by aminallam »

I cannot submit it, because I use an array:
char D[50][101][3000];
But how can I avoid it, and get the path (the actual string number) at end?

Post Reply

Return to “Volume 121 (12100-12199)”