11124 - Troubles for Modern Days Problemsetters

[Alec]

I got TL for thousand times. Is there any one give me some help on it. Thank you very much!!

[fpavetic]

there is a way to find kth element in unsorted sequence in O(n) average, where n is the length of the sequence.

[Jan]

The problem states

IList(5,0,1)+IList(3,6,0)+IList(5,5,-1) generates the list: 0 1 2 3 4 5 6 6 6 5 4 3 2 1 0.

shouldn't it be

IList(5,0,1)+IList(3,6,0)+IList(5,5,-1) generates the list: 0 1 2 3 4 6 6 6 5 4 3 2 1.

[little joey]

You are absolutely right
Luckily it doesn't matter for the samples...

[FAQ]

Some I/O please I still got WA
is there any test like NList(0) ?

[kalinov]

Watch out for overflow... Try this:

Code: Select all

input:
5
RList(10,-2147483648,2147483647,4294967295)
0

output:
Case 1: 2139940657

[Jan]

Watch out for overflow... Try this:

Code: Select all

input:
5
RList(10,-2147483648,2147483647,4294967295)
0
output:
Case 1: 2139940657

I think there are no test cases like that. The problem is elsewhere. Because reading input, generating list, finding the kth number... so, errors can occur.
FAQ, you can easily make random cases and check your code. To check the output just sort the list and then match the result with the calculated result (calculated in O(n) time). By the way thanks Mr. Joey for this nice problem.

[Mr.south]

I always got TLE

Is there any more efficient way to generate the number list ?

My algorithm is:

generate the list and sort it by qsort and got TLE