Codechef Internship Test

How much did you guys solve? and what is the cutoff? what academic year will get further calls?

what abt u lol

i solved all

1 Like

Ig most of the people solved all the problems as the problems were too standard.

1 Like

i am new to cp so i do only 2 :frowning_face:

2 Likes

if i submit 5 sec before contest will my submission count or not if its count i was able to do 3.5

What was D? Does it involves knowing HLD?

I solved it using LCA.

1 Like

any guess about cutoff may be some hope haaa

I could only solve 3, not sure whether they will select me or not :pensive:

I TRIED LCA BUT IT GOT TLE ONLY 40 PERCENT SUBTASK PASSED HOW U PREPROCESS THE LCA

Nah, straight forward binary lifting

2 Likes

I was also getting partial, but then I saw FASTIO is recommended as input can be large, so after using FASTIO, I got full points.

I solved all, but very late, didn’t know binary lifting.

2 Likes

which advanced algorithm :thinking: ?

Can you briefly describe it? What you did?
I know binary lifting.

Oh I see

just calculate sum from node root to x
now for a query the answer will be (sum(u)+sum(v)-2*sum(lca(u,v))
lca should be computed in LOGN otherwise you will get TLE (binary lifting part )

1 Like

Yup I also did it by LCA with sparse table

how did you solve last problem , i tried half of diameter , but giving wa