Search found 13 matches

by hquilo
Fri Apr 19, 2019 2:58 pm
Forum: Volume 124 (12400-12499)
Topic: 12488 - Start Grid
Replies: 3
Views: 1513

Re: 12488 - Start Grid

Hi Vinit,

Could you please check the second test case you posted?

Code: Select all

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
by hquilo
Sun Jun 19, 2016 6:42 pm
Forum: Volume 11 (1100-1199)
Topic: 1121 - Subsequence
Replies: 5
Views: 3472

Re: 1121 - Subsequence

Just in case: you need to output 0 in case there is no such a subsequence with sum at least s.
by hquilo
Tue Jan 05, 2016 6:44 pm
Forum: Volume 115 (11500-11599)
Topic: 11576 - Scrolling Sign
Replies: 9
Views: 4732

Re: 11576 - Scrolling Sign

@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. ...
by hquilo
Sat Dec 26, 2015 3:10 pm
Forum: Bugs and suggestions
Topic: 269 - Counting Patterns
Replies: 3
Views: 3077

Re: 269 - Counting Patterns

Hi all,

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

Regards,
by hquilo
Tue Dec 01, 2015 3:45 pm
Forum: Bugs and suggestions
Topic: 269 - Counting Patterns
Replies: 3
Views: 3077

Re: 269 - Counting Patterns

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 ...
by hquilo
Tue Dec 01, 2015 3:30 pm
Forum: Volume 11 (1100-1199)
Topic: 1118 - Binary Stirling Numbers
Replies: 0
Views: 902

Re: 1118 - Binary Stirling Numbers

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.
by hquilo
Wed Apr 01, 2015 7:08 pm
Forum: Volume 101 (10100-10199)
Topic: 10187 - From Dusk Till Dawn
Replies: 50
Views: 17930

Re: 10187 - From Dusk Till Dawn

@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
by hquilo
Fri Mar 27, 2015 8:38 pm
Forum: Volume 108 (10800-10899)
Topic: 10801 - Lift Hopping
Replies: 56
Views: 26797

Re: 10801 - Lift Hopping

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
by hquilo
Fri Mar 06, 2015 3:30 pm
Forum: Volume 108 (10800-10899)
Topic: 10895 - Matrix Transpose
Replies: 17
Views: 5086

Re: 10895 - Matrix Transpose

Some sample test cases

Input

Code: Select all

4 2
1 1
1
1 1
2
1 1
3
1 1
4
4 4
1 1
1
1 2
2
1 3
3
1 4
4
1 1
1 1
8
1 2
2 1 2
1 -1
AC output:

Code: Select all

2 4
4 1 2 3 4
1 2 3 4
0

4 4
1 1
1
1 2
2
1 3
3
1 4
4
1 1
1 1
8
2 1
1 1
1
1 1
-1
by hquilo
Mon Feb 23, 2015 9:42 pm
Forum: Volume 115 (11500-11599)
Topic: 11576 - Scrolling Sign
Replies: 9
Views: 4732

Re: 11576 - Scrolling Sign

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...
by hquilo
Mon Dec 15, 2014 4:40 pm
Forum: Volume 8 (800-899)
Topic: 869 - Airline Comparison
Replies: 7
Views: 4948

Re: 869 - Airline Comparison

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 ...
by hquilo
Wed Aug 20, 2014 12:17 pm
Forum: Volume 5 (500-599)
Topic: 544 - Heavy Cargo
Replies: 32
Views: 14510

Re: 544 - Heavy Cargo

@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
by hquilo
Fri May 02, 2014 9:57 pm
Forum: Volume 5 (500-599)
Topic: 558 - Wormholes
Replies: 30
Views: 14939

Re: 558 - Wormholes

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...

Go to advanced search