### chinesecoder's blog

By chinesecoder, history, 2 months ago, ,

Wowoowowoowowowoowowww.. someone please tell TozanSoutherpacks that I am his fan. feeling amazed to get a mentioned by him..... toooooooooooooo sweeett : ) ) )) ) ))

here he mentioned me : _ _ _ )) ) )

• -35

By chinesecoder, history, 9 months ago, ,

Hello , does anyone know any good tutorials on tries and persistent tries ? can you please give me the source from where you study these two algorithms !

Thanks !

• -10

By chinesecoder, history, 9 months ago, ,

The problem , 814c , my approach was , for each segment [l, r ] , check whether its possible to color it with at most m colors or not.

since there can be 26*n queries and n^2 segments , the solution will work in 26*n^3 which will give TLE .

The editorial mentions some prefix based approach but i couldn't understand the 2nd part , how its optimizing the solution .

How to reduce 26 * n ^3 to 26*n ^2 .

is there any dp solution possible to it . ?

• -14

By chinesecoder, history, 10 months ago, ,

in problem d , jongmah , the editorial is dealing with types of at most 2 consecutive elements like i , i+1 , i+2 .

but where are the triplets which are in the form of i , i , i . how to deal with them . since we are not dealing with same triplets how it will give to correct answer , i couldn't understood the author's approach , can anyone elaborate it .

The author said "So we can assume that there are at most 2 triples of type [x,x+1,x+2] for each x." where triplets of x ,x ,x are gone ?

• -10

By chinesecoder, history, 10 months ago, ,

Hello . Right now three platforms are best for competitive programming .

Codeforces **** Topcoder **** AtCoder

I will not ask about codeforces as its my personal favoirite . __ which is best among Topcoder and Atcoder with respect to you . Which is good for the practicing for ACM ICPC , Code Jam etc .

Your suggestions . or should i use both ? **** if anyone doesn't want to reply here he can DM me .

• -28

By chinesecoder, history, 11 months ago, ,

why solving max flow problems which algorithm should i use ? dicnic or EK?

i heard dicnic is easier to code

• -26

By chinesecoder, history, 11 months ago, ,

Please tell me how to install and use sublime for c++ . i use codeblocks but it crashes manytimes .

• -3

By chinesecoder, history, 11 months ago, ,

suppose we are doing dfs on tree .

Your code here...

dfs(int current ,  int parent)
{
for(auto child : v[current]
{
if(child == parent) continue ;
dfs(child , current);
code...
what happens when we write something here.

}
code ....
And what happens when we write something here ...

}


what are the difference between two above .

Please tell , i have difficulty in distinguishing between two

• -4

By chinesecoder, history, 12 months ago, ,

where can i get the live stream of topcoder open 2018 ? does anyone know or share the link %

• +2

By chinesecoder, history, 13 months ago, ,

Can anyone please help me in understanding what the problem is saying ... and also its approach

49E

• 0

By chinesecoder, history, 14 months ago, ,

Can a question which can be solved with dfs can also be solved with bfs if we use the right modifications and ideas¿

• -2

By chinesecoder, history, 17 months ago, ,