OJ Board

OK. I got it.

Wojciech

I'm getting WA using DP method. Are there any special inputs for this problem?

Wojciech

I've the same problem. Could Anybody explain how to
find minimum number of lines, which cover all zeros in matrix ?

Wojciech

Another question to case insensitive comparison. What is the correct output for:

2
a1 : 1 min 1 sec 1 ms
aa : 1 min 1 sec 1 ms

Is it:

Row1
a1
aa

?

Wojciech

Who knows

Try
Code:
2
-1 1


The output should be 1.

I've doubts whether this is correct. In accordance to the problem wording we've to find the maximum positive product. In the quoted case the only product we can obtain is -1 so the correct output should be 0!

Wojciech

I use C++. If there are no critical inputs it must be a simple mistake in the code. I'll look into. Thanks

Wojciech

I'd do it but I've no idea what the critical inputs could be.
Wojciech

I'm getting WA.
What is correct output for:
4
0 0 0 1
0 1 1 1
1 1 1 0
1 0 0 0

my output is:

Top sticks: 4.

Is it correct? Any other I/O's?

For last submissions I haven't got any submission confirmation by e-mail. Is it any problem with online judge or this is intended change by site admin? I'd appreciate to obtain the submission confirmation by e-mail as it was before.

Wojciech

Hi tan_Yui!

I had a problem with inputs like this:

1 10 1
1 1 1 3 E
1 8
10 1 1
10 1 1 3 S
5 12
0 0 0

The correct output is:
6
6

Now I got AC

Thanks to Moha and tan_Yui!

Wojciech

My program gives the same output as yours but I got WA too. I've no idea what could be the problem now.

Wojciech

Hi tan_Tui!

For Your input my code gives:
96
99
99
93
93
99
95
9874

However I got WA too!

Wojciech

Hi,

Another question: Is it possible that 2 sprinklers have the same coordinates (but maybe different R and/or d)?

Wojciech

Hi,

I found a mistake already - I/O's not longer needed.

Regards

Wojciech