HOMELESS - Homeless Jozo

no tags 


hide comments
Ángel de Vicente: 2009-05-21 17:36:28

Either I'm misunderstanding something or the problem exmaples are wrong? For example, in sample 2 the different trains would be at these times in the different stations: (station,time)

train1 (1,25),(3,42),(2,52)
train2 (1,25),(2,41),(4,47)
train3 (1,4),(2,20),(3,30),(4,39)
train4 (4,52),(2,58),(1,74),(4,93)
train5 (2,64),(3,74),(4,83),(1,102)

So there is no way that Jozo would be back in Station 1 between the times 80-100.

Did I misunderstand something?

[Trichromatic] XilinX: 2009-05-21 13:28:57

Please set the "Assessment type" option to "binary" and rejudge this problem. A classical problem should be ACM style.

Last edit: 2009-05-21 13:20:26

Added by:psetter
Date:2009-05-04
Time limit:0.200s-0.800s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:COI 03