OJ Board

I have a problem..
I have exactly the same problem. The problem appears yesterday.
My judge ID is 30513.


Just one question...has that account ever been yours? I mean...we've recycled some accounts without submissions. Maybe that's one of them, and the system uses old system's data (old user's ...

mf wrote:The choice of the root doesn't matter at all! (My solution always uses node #1 as root.)

Wow.. cool Thank you!

10938 "Flea circus" can be solved with LCA.

Thank you, but..
.. how to solve this problem using LCA? In LCA we need a tree with selected root. Even if we precalculate LCA for each node of the tree selected as a root, we still need a O(N) time for every query to decide which node should be ...

Can anyone recommend me some problem in UVA's problemset to test my solution to the LCA problem?

You don't need Dijkstra the first time, but you can use a (simpler and faster) BFS to check if a path exists for a given max. temperature. Then use one Dijkstra to find the shortest path.
Ah.. Silly of me :oops: :oops:


To decide where to go, they will pick a route that the highest ...

Adrian Kuegel wrote:You can do it with two dijkstras like Observer suggested. I doubt you can do it with one.

Hmm.. I missed something?
Where is his suggestion about this problem? Give me a link, please.

Hi!
Solving this problem, I stored all possible temperatures in the array, sort it in the ascending order, and then start to solve this problem for a fixed temperature using simple Dijkstra algorithm until i found a temperature where solution exist.
This algorithm can be upgraded using binary search ...

Hello, Eduard.
Sure, I know that 10**30 is greater then 2**64. But I mean, that we could represent our numbers as A*10**15+B, where A and B are Int64 numbers.
So, may be the implementation of BigNumbers using this representation is easier than implementation in general case?

I think that it's not ...

Hi!

If there exist a simple way to solve this problem
(without writing classic "long arithmetics" )?
May be we could use that P,Q < 10**30, so both of them could be represented as a pair of two 64-bit integers?

I remember reading somewhere that there are two types of programmers: programmers that think iteratively, and programmers that think recursively when they are trying to concieve an algorithm. The second type (to which I also belong) seems to be in the minority.

And the majority of this minority ...

Oh, I understand

I used a pdf-version of this problem, in wich the symbol '=' is used instead of ':'

Carefully compare the output from your program with the sample output ... notice any difference? :D

OK - I fixed the excess blank line in the end of my output file, by changing the main part for this
[pascal]
Var Iter : Integer;
First : Boolean;
Begin
Iter:=0;
First:=True;
While Load Do Begin ...

I used simple DP-based algorithm to find LCS. Everything seems to be OK, but I've got WA.

[pascal]
Type Integer = LongInt;
Const MaxN = 100;
Var A, B : Array[1..MaxN] Of Integer;
N, M : Integer;
D : Array[0..MaxN, 0..MaxN] Of Integer;

Function Load : Boolean;
Var I : Integer;
Begin
Load:=False ...

Thanks

Hello everyone.
Where can i find and submit problems from ACM ICPC World Finals?
i can't find them in acm.uva.es problemset