Search found 4 matches

by Piotr42
Fri Feb 03, 2012 9:09 am
Forum: Algorithms
Topic: graph problem
Replies: 2
Views: 4391

Re: graph problem

the point is that I am not given all vertices between start and end (I should have mention that, sorry) I think I've found a better solution - for each fixed vertex I create a subgraph that consists of only two fixed vertices (those that should be "neighbours") and all other non-fixed vertices and u...
by Piotr42
Thu Feb 02, 2012 9:42 pm
Forum: Algorithms
Topic: graph problem
Replies: 2
Views: 4391

graph problem

Hi, could you please help me with this problem (it is not contest-related problem): I have got a weight undirect graph and a list of vertices I have to visit I want to find shortest path (from source vertex to destination vertex) with no cycles, I have to visit each vertex exactly once (also order o...
by Piotr42
Sun Dec 23, 2007 5:56 pm
Forum: Volume 102 (10200-10299)
Topic: 10256 - The Great Divide
Replies: 21
Views: 7507

10256 - time limit

Hi
I've posted this problem in C++ and I've got AC in 2.050
then i posted the same source code in Pascal and I've got TLE and the run time was 3.000 - but the time limit for this problem was 8 sec
so is it a bug in the judge or where is the problem?
thx
by Piotr42
Sun Dec 16, 2007 6:20 pm
Forum: Volume 105 (10500-10599)
Topic: 10541 - Stripe
Replies: 10
Views: 5310

10541 Stripe

can you pls give me som input+output?
or at least some hint how to solve it
i think, the best way is to use combinations, but not pure combinations (because the order of black groups is important)
thanks for any help

Go to advanced search