10952  Pattern Transformations
Moderator: Board moderators
10952  Pattern Transformations
Could someone clarify sample input for this problem.
. XO . .
. . OX .
. XX . .
. . XO .
. XX . .
. . OX .
You don't have to swap any symbols but the answer for this sample input is 1???
What's wrong with this transformation?
. XO . .
. . OX .
. XX . .
. . XO .
. XX . .
. . OX .
You don't have to swap any symbols but the answer for this sample input is 1???
What's wrong with this transformation?
10952  Pattern Transformations
The sample output is wrong for this problem. It should be 0, 0, 1.
It seems I never ran my solution on the sample input, and didn't see the correct answer by manual inspection... terrible sorry for that!
It seems I never ran my solution on the sample input, and didn't see the correct answer by manual inspection... terrible sorry for that!

 System administrator & Problemsetter
 Posts: 399
 Joined: Sat Jan 12, 2002 2:00 am
hmm
To remove any other confusion Derek Kisman was suposed to write alternate for this problem but he could not manage time but when I knew it I had already sent the template so I could not mention that it too did not have alternate solution.
Re: 10952  Pattern Transformations
You probably have an old version of the problem statement. It was fixed, check the new version here: http://acm.uva.es/p/v109/10952.html
Hmm... I see! You are right! I had older version!
Now, how to solve it? Can you please give me some hint?
It seems augmenting path might work. But swap is making all the trouble.
My idea is: Augment path with out making swap. if all the chars are matched then ans is 0. if not then start sweep augmenting path. so andwer is: unmatched/2 where unmatched after first augmneting process. if in the second augmenting process there still remains unmatched chars then 1.
But i think this is wrong process. can anyone please put me on the right track?
Thanks in advance.
Now, how to solve it? Can you please give me some hint?
It seems augmenting path might work. But swap is making all the trouble.
My idea is: Augment path with out making swap. if all the chars are matched then ans is 0. if not then start sweep augmenting path. so andwer is: unmatched/2 where unmatched after first augmneting process. if in the second augmenting process there still remains unmatched chars then 1.
But i think this is wrong process. can anyone please put me on the right track?
Thanks in advance.
Self judging is the best judging!