UVa OJ Board

Hi! My solution (which got AC ;-) was quite simple : for each letter find it's first and last occurence in current string. select letter for which sum of distances from it's first occurence to beginning and from last one to the end is smallest. "move it" I mean swap it's first occurence to beginning...

Hi! my solution was similar : - find maximal matching beetween points ( we are trying to match points that have indeg-outdeg > 0 with points that have indeg-outdeg < 0 ) thanks to this we can direct some undirected edges. So now if for all verticles indeg(v)==outdeg(v) and degree(v) is even the eule...

I found my mistake .....

just a small one I had some problems, when they could met in the last minute ....

Thanks a lot for help

Best Regads

You have to choose the task you want to submit, and there is a button Submit near it ...

Because you have to use different submit script

Hi! If you are writing about task 590 : there you have to use some kind of dynamic programming ... let us assume that we have an array [1..n][1..k] in the cell with index [a] there is an integer which is the smallest amount of money she has to spent to get to city number a after b days ... You begin...

Hi!
Thanks for answering ...

Adrian Kuegel wrote: Try this input:
1 2147483647 2147483647 2147483647

Unfortunately I use long long's for this and I don't think this may cause overflow problems..
My answer for this test is :

4611686014132420609

(Or is it wrong answer ??? )

Hi!

I tried to code this task on the contest but got WA.
Later I rewrote this task (this time without using any floats etc) and still got WA..

Does anyone have any tricky inputs for this task ??

Thanks in advance
Good Luck

Hi! I basically had two approaches in mind. 1) only store the best score for a colour 2) only consider (if they exist) z that have the same colour of a. Yes. You are right that the first one is wrong.. But the second one is what I thought about.. So if you have a to count the range from a to b .. Yo...

Hi ! Hmmm, I still don't get it completely... Do you mean something like this: [c] struct erased { int colour; int ndeleted; int score; struct erased * nextcolour; }; struct erased *array[a] ; [/c] Yes that's was I was thinking about. . So now, (as you can easily see) the memory you need is much muc...

What is the value? The score obtained erasing the range of blocks? Yes.. It is what I was thinking about... I understand that if I have two adiacent ranges of the same colour like this: [a, i, c, d]=k [i+1, b, c, e]=l then I get: [a,b,c,d+e]=k+l+2*d*e If I have adiacent ranges of different colours:...

Hi! Yes I will help you, as much as I can ;-) So I can give you a few hints : 1. Think about dynamic programming... where you have to fill the array[1..n,1..n,1..n,1..n] .. Descirption : if value of [a,b,c,d] = n then it is possible to "erase" all the elements beetween position a and position b, the...

Hi!

Everything depends on your algorithm ....

You can reduce your running time (and complexity) very easy...

But first, could you write what algorithm do you use ..


Otherwise, I cannot help you

Good Luck

Hi!

There is only simple DP. But you have to consider avenues 1 and 100 also, and remember that if you were said to divide it with 8 avenues, you have to output 8 avenues (even if the same optimal anser is for 4 )

I hope I will help you

Best regards

CYFRA

Hi! Hmm.. your method is good. I also did it with Dijkstra for finding the shortest pathes... (and got AC in less then 1sec) But I think that there are 2 things that can cause TLE... 1.) Check how long your function for visiting cities works. ( the function, that counts the minimal number of cash yo...

Look carefully at the limits


That was my bug...

Hope it will help

Good Luck