OJ Board

what algo to use ...

I think somee dp...

any hint about it and the algo complexity...

I can't see the dp yet. Can it be backtracking?

some one hhelp on this topic...

no reponses yet

I'll try backtracking.

do respond if accepted...

thanks in advance..

I got AC.
Whether or not you get TLE will depends how fast you can do the following.
Input: Output:

what is ur algo...???

Its a simple backtracking and u have to check triples efficienty.

suppose u have string S so far in backtracking and s is a suffix of S and |s| should be multiple of 3. use this idea.

thanks

it tle's.....
here is my code...

how can i improve upon it??

the way that you use stl string makes it tle. You keep passing string as argument to your functions, which is slow. You don't need to pass any string as argument, just keep it simple and working directly with a char array is enough.

thanks ...
its AC in 1.682 secs..

strings are really very slow....
i need to minimize thrie usage

im getting TLE in this problem. any possible optimization u want me to consider. i used backtracking. here is the code:


GOT AC CODE DELETED

thank you

You are checking the validity after calculating a full sequence. Try to check the validity while calculating a sequence.

Input: Output: You will see the output instantly if your code is alright.

Jan wrote:

You are checking the validity after calculating a full sequence.

this is not right. i did check for validity after putting every character. my problem was that i didn't check the validity efficiently. my code for checking the validity was naive, now i changed it and got ac in around 3 seconds. thank you anywayz for your reply Jan.
BYE