OJ Board

smile2ka10

We will revise the problem statement, regarding your suggestions soon. But some points: The first part of this sentence contradicts the second part in two ways: 'less than' vs. '>=', and 'range of b1' vs. 'b2.range'. 'range of b1' should be replaced with 'range of b2', but the comparisons are correc...

smile2ka10

no it is not bicoloring!
It is vertex cover problem.

smile2ka10

There wont be such testcase, all the input letters are lower case, anyway if we consider all 'V' and 'v' the same character the answer would be: 9 (for the 3*3 square in the middle of the input)

smile2ka10

Well, I thought your fault is in negative inputs!
anyway, instead

Code: Select all

if(number>1000)
cout<<0<<endl;

put after your main loop:

Code: Select all

if(go)cout<<0<<endl;

smile2ka10

Don't you think that 1 is a power of 10?! ;)

smile2ka10

There are two points about your code: First, you set p[1][1] after reading input to 1 which is supposed to mean that there is one way to cell (1,1) but it is possible that this cell is blocked so that the answer would be zero paths to cell (r,c). Second, there is an error in the reading inputs where...

smile2ka10

I 've put some sample random generated I/O here:
http://online-judge.uva.es/board/viewto ... 9762#49762

smile2ka10

Try this I/O: 42184686335.0 265011917015725.1 114792935926963.2 24465570628146.3 23282168289962.4 492299611943.5 4828543732392.6 146053903154.7 2931238317422.8 187171971919896.9 54482172714772.0 11539187019913.1 256682630017036.2 98952870423812.3 313233033417674.4 4665151427712.5 28254686925548.6 27...

smile2ka10

Thanks a lot daveon, I got AC!

But according to these two statements I think the judge data is incorrect.

[quote] It is also possible to capture the opponent

smile2ka10

Could someone help me about the test case below; what color should be removed from the following table?

.........
.........
.........
......X..
.....XOX.
.....OXO.
......O..
.........
.........

I tried too many times and got WA everytime.

thx in advance.

smile2ka10

According to what erdos said, i used this code and it got accepted:

Code: Select all

	for(cin>>n;n--;)
	{
		cin>>h>>w;
		if(!n)w=39;

except this i read normally from the input(char by char).

smile2ka10

there are some I/O that might help... Input: 3 3 25 37 45 51 12 34 94 83 27 10000 3 3 25 37 45 51 12 34 94 83 27 100000 3 1 -6 -5 -4 300 3 1 -6 -5 -4 301 3 1 -6 -5 -4 100 0 0 Expected Output: Region 1 Water level is 46.67 meters. 66.67 percent of the region is under water. Region 2 Water level is 15...

smile2ka10

I ve tried to solve this problem in this way: -First I exmaine each component if they can move, when i find such a component, change it's bricks to another charachter that would be considered as a free space. then I use dfs to find whether there is another component that can pass through free spaces...

OJ Board

Search found 13 matches

852 - Deciding victory in Go