Play on Words

Can i get the input for which the program failed?

I would like to know to which test case the program failed. Please facilitate that.,

Please read the FAQ at http://blog.codechef.com/2009/06/29/frequently-asked-questions/

Hi, I keep getting a "Time exceeded" error each time I submit my solution. I tried executing my solution on my home computer with a large input (75000 strings) and it computes the solution within 1 sec. The time limit posted for the solution is 7 secs. Why am I getting this error ? What size of input are you using ? ---- my output --- $ time ./a.out < NORM.DIC Ordering is possible. real 0m1.063s user 0m1.008s sys 0m0.036s ------ end output ----- Siva

You might want to try with a large set of strings for which the door can be opened. If you keep getting TLE, then you either need to improve your algorithm or optimize it.

can i get the test cases for this program. my program is running absolutely fine on my pc

Currently it is not possible to give test cases as then it would be possible to hardcode the values and submit the code.

Can we know how much time our problem took, when it exceeds the time limit?

That way we would know how much improvements we must make in our programs..

Currently this is not possible because as soon as the program exceeds the time limit, it is terminated. Some programs take an infinite amount of time to execute, so such an approach wouldn't really help.

i keep getting wrong asnwer wrong answer :(

help needed....i m fed up.....

what should be the output when only one word is entered???

 

This should be evident from the problem statement :)

i tried both the things still not working ...!!!!

can u provide some more sample cases..I can't detect the flaw!!!!!

It should be easy to create large random samples and test by first creating a very large sample which is correct in a greedy fashion and then using a random permutation of it as the test input.

i need some test cases where the program is failing.

i have even corrected the earlier error..changed everything

still couldn't figure out what is happening...

There's a very useful test case for this problem on the forum.

 

Unfortunately, it ruins my algorithm completely.

can any one please mail me the solution of this problem????

I'm execute in Borland c++, but i could not code for the above given languages,,,, can any one help me ???????

 

Though this may sound very noobish, here i go. Im new to all this, gcc and stdin/stdout. Ive submitted my soultiona nd am getting a segmentation fault. When i executed it on my own machine (in gcc) by taking in inputs whenever required i could arrive at the desired results, which forces me to think that im making a mistake in taking in input. I will post my code segment wherin i take in input and any suggestions or tweaks would be greatly appreciated.

#include <stdio.h>
#include <string.h>
int main ()
{
int tc=0;
scanf("%d",&tc);  //take in test cases
while(tc--)  
{


scanf("%d",&count);  //take in word count
while(count--)
{
//code segment

}

return 0;
}

 

Sorry, the correct code for the above comment is as follows

 

#include <stdio.h>
#include <string.h>
int main ()
{
int tc=0;
scanf("%d",&tc);  //take in test cases
while(tc--)  
{


scanf("%d",&count);  //take in word count
while(count--)
{
//code segment

}

}
return 0;
}

 

 

Vignesh

can you plz let me know where m i going wrong??? it seems correct on my part...

a) You aren't reading input correctly. Read the FAQ.

b) Your code will fail on cases like aa bb.

Doesn't the problem reduce to determining the existence of a Hamiltonian path (chain) in a directed graph? And the latter is an NPC problem.

The problem is solvable. That answers your question.