[ Contest Page | Scoreboard | Submissions | Clarifications | Help | Stuff | Log In ]

Problem | Clarification |
---|---|

General |
I/O?Please use standard in and standard out!Input -- Java: Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in))); C: scanf("%d %d", &integer1, &integer2); C++: int x; cin >> x; Output -- Java: System.out.println("asdf"); C: printf("%d %d", integer1, integer2); C++: int x = 5; cout << x << endl; |

General |
Java class names?Java class names?Please use the following class names (make sure classes are public): Problem A - public class A { ... } Problem B - public class B { ... } . . . |

General |
Compilers?gcc 4.8.1javac 1.7.0_51 python 2.7.6 |

General |
Time Limits?5 seconds per problem |

C - Coordinated Motions |
If a robot is at (0,0), what part of the robot is specifically at (0,0)?The coordinates given describe the lower left corner of the robot. |

C - Coordinated Motions |
Do robots have to be constantly moving? e.g. can one robot wait for another robot to pass?Yes they can wait. The robots can move in any way they want, and take any amount of time to get to the destination. Only the total distance matters. |

D - Dan and Linton |
The smallest strongly connected component containing x and y? Is this correct?You should output the minimum number of edges in S. We are currently fixing the problem statement. |

G - Golduck and the Three Teddiursas |
Does the total of the +/-1s always have to be within [L,R] during the entire path? Or only the total at the bottom right of A?Only the total at the end of the path must be within [L,R]. |

A - Andrew's Annual Race |
In the second sample case, either the answer should be infinity or the problem statement doesn't properly explain why the answer should be finite. Which is it?The optimal sequence of moves for sample 2 is:leftmost 1 -> rightmost 2 -> 3. Andy "jumps" from number to number, so when he moves from the leftmost 1 to the rightmost 2, he travels distance = 4 and goes from 1 to 2 directly. |

A - Andrew's Annual Race |
Can the trainer revisit checkpoints? if the trainer is supposed to visit a 2 checkpoint is s/he allowed to move through a 3 checkpoint? for the second provided example of 1 1 3 2 2 the path would be 1-1-3-2-2-2(turn back and revisit)-3?Yes. To clarify, its he "jumps" from checkpoint to checkpoint with distance equal to the difference between the checkpoint's indices. |

B - Bulbasaur Charity |
when the journey is to stay in one city, does the traveller earn 0?Yes. |

G - Golduck and the Three Teddiursas |
A test case has a line with n, m, L, R, but also some other lines. Are those describing the matrix?Yes, please hard refresh the problem statement. This is now corrected. |

H - Here to Battle! |
What happens if no gym can be defeated?It is guaranteed that at least one gym can be defeated. |

B - Bulbasaur Charity |
What does m stands forThe amount of Bulbasaurs a city places on its roads is in the interval [-m,m]. |

B - Bulbasaur Charity |
What does m represent?The amount of Bulbasaurs a city places on its roads is in the interval [-m,m]. |

A - Andrew's Annual Race |
Can you move arbitrarily within contiguous segments? [ie. Is this movement allowed?]You cannot move back and forth between two of the same numbers forever, if this is what you are asking. Each movement must move in one direction towards the next higher numbered checkpoint. |

A - Andrew's Annual Race |
Do you start at position 0, or the first checkpoint?You can start at any checkpoint that is marked by a 1 |

F - Fearsome Travelling Gang |
What's the bound on T?Reasonable (~100). |

C - Coordinated Motions |
Can we assume A and B doesn't start at the same location and/or doesn't go to the same destination?Yes. Specifically, A does not equal B and A' does not equal B'. |

B - Bulbasaur Charity |
It says starting at one city ending at another, can the traveller decide to not visit all(any?) of the cities ?Yes. This is poor wording on the problems part. The statement has been corrected. |

E - Evil vs. Good |
What happens if a Type 2 cannon shot hits cannons that have finished charging at the exact same time they are hit?The cannon fires. Cannons on both sides finish charging before firing, so the cannon can finish charging before the Type 2 fires (and it fires as well). |

C - Coordinated Motions |
>the two robots cannot intersect Does this mean their paths cannot intersect? Or that the two robots cannot occupy the same space at the same time? The two robots cannot occupy the same space at the same time, but they may touch. |

D - Dan and Linton |
Are two roads (x, y) and (y, x) considered to be the same road for counting purposes?No, the roads are one-way so (x,y) and (y,x) are different, counting as 2 roads. |

E - Evil vs. Good |
can a cannon fire the same second it finishes charging?Yes, once a cannon finishes charging it fires. |

E - Evil vs. Good |
Can a cannon have W_i = 0 and C_i = 0, so that it doesn't have to wait before starting to charge, and doesn't takes time to charge?It is guaranteed that at least one of W_i or C_i is positive (i.e. this does not occur). |

C - Coordinated Motions |
can one robot stay at its place while the other one moves or should they move synchronically ?Please read all the clarifications carefully. |

E - Evil vs. Good |
can a cannon charge the same second it's cooldown time (Wi) expires?Once Wi finishes the cannon begins charging, i.e. if cooldown starts at T=5, Wi=7, then it starts charging at T=12. |

E - Evil vs. Good |
if a cannon has 0 charge time and 0 wait time, does its city automatically winrefresh the problem statement. this case does not exist in the test data. |

C - Coordinated Motions |
can distance be negative?you mean like time travel? (no) |

Ultra Cool Programming Contest Control Centre v1.8

Copyright (c) 2005-2010 by Sonny Chan