OJ Board

You can do it in O(NlogN).

You can solve for the columns and rows independently, as you mentioned.
For assigning the rooks to different columns, here is a hint, in the form of questions :)

You can ignore 1 below, if you know an O(N^2) solution aleady.
1) Let x = how many rooks can be assigned to ...

Your "max" calculation seems to be flawed.
The "max" variable will not be correct if the maximum value of counter occurs at the end of the array.

For example
on example
4
1 1 1 1

IIUC, max will be 1 according to your code; and not 4 as it should be.

After going through misof's article, I had a thought about how judging can be done at the IOI to promote correctness ahead of heuristics.

For each problem, have 3 or 4 different input files, each containing multiple test cases , each file testing a particular aspect of the solution.

A solution ...

Ohh wait was that WA in 4 sec.
The limit is 10 tubes right?
I made such mistake once with a limit of 50,and it timed out.

I forgot, mixing A with B need not be same as mixing B with A.

for (int y=1;y<w;y++)
for (int l=0;l<w;l++)
if (y>l)
if ((l==0)||(p[l]!=p[l-1]))

this could be changed to ...

I think this will timeout always no matter what encoding is used.
If you look at it,in essence, you are
trying to find the shortest path by DFS.
The problem is that you are memoizing heats evolved in getting to
a particular state from the start state, and redoing the calculation
from this state to ...

What was your state encoding?
If i remember right, I used a single integer for the state for
memoization.
The first time,i used a vector<int> for the state and got TLE.
Thx,
Subra.

Got it now,
i missed(??!!) the case n=0(my base cases were n=1 2 and 3)

n=0 doesn't really make sense even though it is not forbidden
by the input.I was misled by the statement that the numbering
can be 1,2,3...,n interpreting that there was atleast 1 marble.

I guess the input should be ...

Those are exactly what i get,

can you provide output for

2
64
65

mine says :
7905747460161236406
15811494920322472813

Thanks,
subbu.

I interpret this problem as follows.

Given 3 towers and n disks, 1,2,3,,,n

separate the odd numbered disks from the even numbered disks
standard towers of hanoi rules applying.

My solution for this matches for n = 15(14043)

Can anybody give outputs for the following:

10
1
2
3
4
5
6
7
8
9
10 ...

to minskcity:

I am guessing you r doing the same thing as i am.

Try using the hint form of insertion into the set,to make it
constant time per insertion.

http://online-judge.uva.es/board/viewtopic.php?t=1989&sid=27b745ed69e7ab27f183b15a1bad9239

u can look at this post.
try reading some pattern.
(it is not hard to find the pattern from the outputs provided by nick)

i still can't find a pattern for numbers of the form
6K+2 or 6K+3 ( 8,9 ,14,15 ...

I solved this problem by taking 2 cases.

1) N is *NOT* of the form 6K+2 or 6k+3

this case, i print the soln. directly.

2)N is of the form 6K+2 or 6K+3

For this case i ran a minimum conflicts local search
and got AC in 5 sec.

I am convinced that there is some general pattern for the case
n = 6K ...

I solved this problem by taking 2 cases.

1) N is *NOT* of the form 6K+2 or 6k+3

this case, i print the soln. directly.

2)N is of the form 6K+2 or 6K+3

For this case i ran a minimum conflicts local search
and got AC in 5 sec.

I am convinced that there is some general pattern for the case
n = 6K ...

Count the number of palindromes that can be made out of
subsets of the characters of the
given string,
maintaining the order(no permutations allowed).
(same characters at different positions are considered different).

For every palindrome u find in the above way,
there is a unique way of scoring ...

hey
Did u consider that modulo of a negative number is negative.

I made this mistake, using modulo of a negative number in
a array index.

good luk.