OJ Board

I looked at sample input, 10 x 10, but did not understand how is it "Yes" when the square box
xx
xx
is no where in the 10 x 10 grid! The problem description does say all ships are supposed in. NO?

It got me thinking quite a while.
Here is what I think:
Arabic Numerals XX + XX = MXC ( where M = 1, X = 9, C = 8 )
substitute all values, it reads:
99 + 99 = 198

which is BODMAS math.

Now how you substitute what values for X, M or C is going to be computational expensive... Definitely longer ...

Just as I thought, the sample input cherry picks letters to form palindromes. Here are my inputs:
tool loot
old gold
pool loop
scoop tea eat poop
yacht natch
stripe pride
fool aloof
feed beef
evil live
deal lead
merit item
pit tip
error terror
rage gear
keep eye peek
leg gel
owl flow
utter rut
doom ...

I went through problem description looking for sort and ordered in addition to balanced output. I found none, hence "([)]" should be Yes. Meaning the input can be jumbled as long as it balances in the end.

dont open a new thread as there is already many threads...think about that.
however ur ...

I did 320 for the fun of it. The output is unexpected . Compile and take a look for yourself.


//
// File: newmain.cc
// Author: Vaio
//
// Created on September 17, 2008, 7:32 PM
// There is a difference between points and squares but the diagram is plain
// wrong.

#include <iostream>
#include ...

Greetings zaza, it is now g++ 4.3.0, and processors have dual core churning 64 bits; random_shuffle is part of <algorithm>.
compiling your code now gives warning between unsigned and signed integers, it runs OK!

woops, electronic board posting ate whitespaces that is meant to be empty squares.
any way, here is what i meant:
"K r b"

Here is a favourite test case that i use in the early stage.

K r b

Greetings Darko,
my code outputs "Draw" after 50x2 moves.
Do you have more sample data?

Same here, will need lots of sample data. Including the ones that reduce to an
empty board.

Prepare for the biggest data input, pick a data type that will accomodate it.
Wish i have 64-bit machine to play with...

I have recently completed this problem.
it compiled with error on Judge, but no problems with RH gcc-4.1.1...

Wanna provide me with sample data? Will let you peek at my solution

I am confused by the problem description of 7 cards dealt,
should not the 7th card cover the 4th card 8D <- 3H ?
before 3H gets played on a different pile all by itself?
8S + 3H is 11, so a covering should take place right above 8D. NO?

Look, i can only show one way of doing it. (There are a few i know)
It is up to you to figure out the details.

Please make yourself useful and gimme sample inputs. Lots and lots of sample inputs!

The algo needs tweaking so that it could fit p721.
Will need some re-definition of structs to represent sample input...
otherwise, the algo takes care of the rest.

Besides this algo, i am currently implementing Dikestra's algo + weighted graph
for this problem. It will go far...

BTW, do you play ...