Search found 4 matches

by Shoou-I Yu
Mon Sep 19, 2005 3:22 pm
Forum: Volume 108 (10800-10899)
Topic: 10890 - Maze
Replies: 13
Views: 9090

cho: thanks for the answers to the test data

kp: thanks for the simple but excellent and efficient idea
got AC now

thanks again! :D
by Shoou-I Yu
Mon Sep 19, 2005 5:26 am
Forum: Volume 108 (10800-10899)
Topic: 10890 - Maze
Replies: 13
Views: 9090

To kp: I am sorry I don't really understand what you mean here. The answer is NO in a following case: if rectangle with corners (x1,y1) and (x2,y2) contain at least one unvisited cell. For this test case, how would your program run? 6 2 2 1 1 4 4 x x x x x E S=start, T=treasure, E=end x x x x T x x ...
by Shoou-I Yu
Sun Sep 18, 2005 10:07 am
Forum: Volume 108 (10800-10899)
Topic: 10890 - Maze
Replies: 13
Views: 9090

I am getting WA on this problem Could anyone who ACed check the answer for these test cases or provide some critical input? Thank you 30 30 10 26 28 6 14 26 29 20 21 12 21 13 8 28 12 16 7 18 2 21 14 24 20 26 28 6 24 21 6 2 13 14 8 0 25 24 10 10 20 18 19 7 9 2 25 3 5 29 18 0 13 5 25 27 18 6 14 5 20 1...
by Shoou-I Yu
Thu Sep 15, 2005 4:24 pm
Forum: Volume 105 (10500-10599)
Topic: 10588 - Queuing at the doctors
Replies: 2
Views: 1635

10588 Queuing at the doctors WA

I don't know why I am getting WA I just simulate the whole process. There is a queue for each doctor, and whenever a new patient arrives, I just put it into the back of the queue. For each time unit, whenver a patient leaves the doctor, I will then put it back into the next doctor's queue on the pat...

Go to advanced search