MSV - Editorial

editorial
, , ,
27

Astonishing XD

@vijju123 - can we get some better testcases for MSV? :slight_smile:

1 Like
28

Yes, we just found the test cases for this problem too weak after the contest started. :sob:

I also agree that codechef needs to allow problems to have many test cases. The reason that we minimize the number of tests is “to reduce server loads”…

But even if you can make a lot of tests, it’s still hard for some problems to make very perfect test data. MSV is an example IMO.

4 Likes
29

tl for python is very strict.I had to use sieve to get comlexity<nlog(n) then only it passed

30

I tried implementing similar solution like @aditya_kandi6 But getting 2 TLE don’t know why this is happening ,Someone please help .

my solution link : https://www.codechef.com/submit/complete/27537109

adityas solution link : CodeChef: Practical coding for everyone

31

I’m getting “Access Denied” for this link.

Edit:

Assuming you meant CodeChef: Practical coding for everyone - there are two extra testcases that have been added in Practice mode that were not in the original OCT19B where adityas’s solution is taken from:

https://www.codechef.com/OCT19B/

Presumably, if adityas re-submitted his solution in Practice mode, it would also now TLE, like yours does.

1 Like
32

“Sum of N over all test cases does not exceed 100,000”. What is the meaning and use of this line given in constraints ?

33

Can you help me with some suggestions to improve my code .

1 Like
34

One optimisation that’s worth doing is to cache the value of sqrt(arr[i]) so that you’re not re-calculating it for every j - not sure if it will be enough to make it AC though :confused:

2 Likes
35

Pretty much exactly what it says - add up the values of N across all T testcases, and the result is guaranteed to be \le 100000.

Without this line, the sum of N across all T test cases could be as high as T \times 100000 =1000000, and this would be too much computation to perform in 1 second. This line tells you that you never have to deal with this extreme case - the sum of N across all T testcases will be much lower than this extreme upper limit.

1 Like
36

Thanks ,Got Accepted :orange_heart:

1 Like
37

Nice one - wasn’t sure if that would work, but am pleased to see it did :slight_smile:

1 Like
38

Was trying to implement the alternate solution but getting WA even on subtask 1.
Any ideas as to where I got wrong?
My solution

1 Like
39

That’s a submission to SAKTAN, not MSV :slight_smile:

40

Ah, sorry!
Solution worked ultimately!

1 Like
41

Can you explain? I didn’t get the logic.

42

just awesome

43

yo :slightly_smiling_face:

44

“check how many times the number at i is a factor of elements at position j(<i)” this line made me understand this problem.
Thanks a lot!!

45

gem!!

46

can you plzz tell me whats wrong in my code
https://www.codechef.com/viewsolution/35863998

i followed what you said… plzz check for any errors