View Clarifications

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

ProblemClarification
F - Painter How many multi-test in one testcase?

50
G - Fuel Stops How many multitests?

100
C - Recursively Palindromic Partitions max size of integer in the input? (unspecified)

1000
C - Recursively Palindromic Partitions What is the bound on the number in the dataset? I only see a bound on the number of data sets.

1000
C - Recursively Palindromic Partitions What is the bound on the magnitude of the integer for any test case?

1000
J - Caterpillar The or in the neighbourhood condition an exclusive or or/and.

If a node is a neighbor of the path, it is adjacent to some node on that path.
J - Caterpillar What is the max number of test cases?

50
E - Cutting Brownies What is the time limit?

2s
F - Painter is N the upper bound on the number of bottles a fingerpainting kit contains, or 12?

The problem statement seems sufficient in this regard.
K - Family Fortune How many multitests?

~1000
A - Route Redundancy Is there limit on sum on node count or edge count over all multitests?

If your solution would be fast enough on a single test case, it will probably be fast enough over the multitest.
General Are white spaces counted in answers

probably
A - Route Redundancy problem a sample data

1
1 7 11 0 6
0 1 3
0 3 3
1 2 4
2 0 3
2 3 1
2 4 2
3 4 2
3 5 6
4 1 1
4 6 1
5 6 9
B - Leapfrog Are the initial frog positions all guaranteed to be distinct? It says "the frogs have arrived on different positions along the central road".

no
H - Seven Kingdoms Are there bounds on m

yes.
H - Seven Kingdoms What is the bound on m

The problem statement is sufficient.
A - Route Redundancy is there a time limit?

yes
A - Route Redundancy does the output have to be exactly to three digits rounded, or does judge accept based on a set tolerance?

The problem statement is clear.
A - Route Redundancy what is the difference between redundancy ratio and minimum redundancy ratio, they are defined as the same quantity

The problem statement is poorly written in that instanace.

The output should be the total number of cars using all routes divided by the maximum number of cars along any single route.
B - Leapfrog what is the time limit for this problem?

2s
K - Family Fortune How many multitests?

~1000

And there is no limit on the sum of N or K? N = 100000 for 1000 cases makes 10^8 input :skull:

If your solution would be fast enough on a single test case, it will probably be fast enough over the multitest.
General Does the scoreboard not update when frozen? (As in we don't see if they submit or not either)

So it seems.

Ultra Cool Programming Contest Control Centre v1.8
Copyright (c) 2005-2010 by Sonny Chan