K-important Strings

Isn,t the output of 3rd test case is given wrong?

@Mahesh The test cases look correct to me.

hi frnds i'm new in ths competition...r we going to check the input given by the user is correct or not? or we hv to keep in mind tht the input supplied by the user will always be correct i.e. in above problem instead of chars a-z if user enters digits wt shd be done? pls clarify for all the problems. Thnks.

@janak If you're new, you should probably read all of the FAQ. The input is guaranteed to be correct.

Are the given n strings distinct??

Please read the problem statement again.

can anybody explain the problem...plssss

@Ankush By definition, a set of N items contains N distinct items.

@AMRITPAL A string H is K-important if, and only if, we can find at least K different positions i in H satisfying the criterion below. The criterion is that the substring of H consisting of the characters i to [i + (L − 1)] matches one of the strings in {S₀, …, S_{N − 1}}.

@brain

pls elloborate with an example. i didn't get it. pls...

thanx for your response...

explain the H and L term in your comment...

my submission is showing runtime error(other)...

what can be the probable reasons???

got the error, K and N were swapped in one of the declared variable (segmentation fault),now accepted :)

I changed the input of the string from

for(int i=1; i<=N; i++) {

for(int j=1; j<=L; j++) do scanf("%c", &s[i][j]) while(s[i][j]==' ' || s[i][j]=='n');

}

to

for(int i=1; i<=N; i++) scanf("%s", &(ss[i][1]));

and got AC from WA.

Does that mean, the input does not follow the specifications in the problem statement?

This WA had been bugging me for a LONG time !

No, the first code you wrote is wrong. You probably haven't read the FAQ.

Can anybody explain that what will be the output if input is

Input

4

4 4 1

abcd

bcde

cdef

defg

4 4 2

abcd

bcde

cdef

defg

4 4 3

abcd

bcde

cdef

defg

4 4 4

abcd

bcde

cdef

defg

hey admin...i am bit  confused abt output...

Each line in the next K lines contains the index of one string in the given set that appears in H and the corresponding position (0-based) in H.

as in input is

3 3 1
abc
cde
bcf

and 

output H is abc bcoz k is 1 and 

3
abc
0 0

i didnt understand the 0 0  output.  it should not be only 0 ? bcoz only single string present in given set

@Ashish

it means 0th string starts from 0th index of "abc"

I had a overview of the FAQ but could not get the soln.

Please do explain...

I got the solution accepted by changing gets to scanf("%s"). I think there is something wrong with the input format. It won't matter for people who use scanf, but the input format should be exactly as mentioned in the question.

Nothing is wrong with the input format.

@charango, I think the output would be

4
abcd
0 0

5
abcde
0 0
1 1

6
abcdef
0 0
1 1
2 2

7
abcdefg
0 0
1 1
2 2
3 3

During a running contest, discussing input values beyond those given can (and should) result in disqualification. Contestants are supposed to work out any extraneous inputs themselves, without any help. Discussing them in public is unfair to those who have already made submissions. It is not hard to fathom that a good part of the challenge in such contests lies in coming up with your own test cases without anyone else being privy to them. Discussing them in public ruins it for everyone.

@ADMINS - This is a serious concern and compromises the integrity of these competitions. I hope you take care of such episodes.

@admin: Is the contest over. I am not able to submit solution for this contest any more. Kindly help.

how DP is to be used in this problem???