OJ Board

hquilo

Hi Vinit,

Could you please check the second test case you posted?

2
12 1
1 12

It does not conform to the input description: "Each competitor is identified by a number from 1 to N." In this case, 12 is not a valid competitor identifier (it should be 2 instead of 12).

Best regards,

Camilo

hquilo

Just in case: you need to output 0 in case there is no such a subsequence with sum at least s.

hquilo

@shahidul_brur, Although the 'W' in the first line can be matched to the 'W' occurring in the second line, the 'D' following the former 'W' does not match the 'H' following the latter 'W'. That is, the substrings 'WD' and 'WH' are not equal. Then, the answer 72 comes from adding 18 exactly 4 times. ...

hquilo

Hi all,

It looks like the official problem statement has been corrected in UVa's website ... great work and thanks a lot!

Regards,

hquilo

Hi, It is a pity that such a nice problem has a faulty problem statement. In the same spirit of @brianfry713, I am contributing a grain of sand by attaching a problem statement in PDF format that is accurate with respect to the current format of the problem's output file in UVa. I am also attaching ...

hquilo

The output description in the PDF version of the problem statement is wrong: there is no blank line in the output between consecutive test cases.

hquilo

@brianfry713

Thanks for the test cases. Can you please double check test case 37?

Code: Select all

3
qhsd iqmpnfkcyghg 5 5
t uvehbv 7 6
seewxvtfmznobypw qvivdykvlpf
f f

The third 'edge' is missing the departure time and the length of the trip.

Regards,

Camilo

hquilo

Hi,

It seems like the judge input does not have test cases in which no elevator stops at floor 0. Given this, for a test case such as (posted previously in this thread)

Code: Select all

2 99
10 40
1 2 3 4 99 0 12
3 4 2 0 12 99

it is OK to output

Code: Select all

IMPOSSIBLE

hquilo

Some sample test cases

Input

Code: Select all

AC output:

Code: Select all

hquilo

Some random test cases. Input: 10 9 50 JWALVHOXB LSCRWGOFX GCMXVBLVE VPGACMSFM BOAVRXPWL ACPJUMUVE TLPVHHYEW KKPXMJUUA MGBPLRXVO AGRVXWDSH BODZKAZMX BHBLKDDOB GTEGGAXPL ZTVQQRYUK VZBQUXQQT WVTAZSYFF VURRRRYZI DIKVHGFHA CCAQUMIQU SMETUYUZV DOOKCIEJH LTHBUASYV VZXFVTMKP RSTGOMCSJ RGZTGCSQK CMRVKJAVT K...

hquilo

Hi, I find the problem statement confusing or incomplete. In particular, it is not clear from the statement if the trip relation is reflexive. Also, it does not mention if N and M can be zero. Consider the following test cases: 3 0 1 a a 1 a a 0 1 a a 1 b b In these three cases the answer should be ...

hquilo

@brianfry713

Thanks for the test cases. Can you please double check the second one? Since there is no road involving city c1, the answer for that particular test case should be 0.

Regards,

Camilo

hquilo

Hi, Thanks vsh041 for the testcases. However, I think that some of them do not conform to the description of the problem. In particular, the statement makes it clear that there is at most one wormhole from one vertex to another; also, there are not 'self-loops'. I have generated the following test c...

OJ Board

Search found 13 matches

Re: 12488 - Start Grid

Re: 1121 - Subsequence

Re: 11576 - Scrolling Sign

Re: 269 - Counting Patterns

Re: 269 - Counting Patterns

Re: 1118 - Binary Stirling Numbers

Re: 10187 - From Dusk Till Dawn

Re: 10801 - Lift Hopping

Re: 10895 - Matrix Transpose

Re: 11576 - Scrolling Sign

Re: 869 - Airline Comparison

Re: 544 - Heavy Cargo

Re: 558 - Wormholes