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

Before contest

Codeforces Round #606 (Div. 1, based on Technocup 2020 Elimination Round 4)

33:52:18

Register now »

Codeforces Round #606 (Div. 1, based on Technocup 2020 Elimination Round 4)

33:52:18

Register now »

*has extra registration

Before contest

Codeforces Round #606 (Div. 2, based on Technocup 2020 Elimination Round 4)

33:52:18

Register now »

Codeforces Round #606 (Div. 2, based on Technocup 2020 Elimination Round 4)

33:52:18

Register now »

*has extra registration

# | User | Rating |
---|---|---|

1 | tourist | 3556 |

2 | wxhtxdy | 3520 |

3 | Radewoosh | 3409 |

4 | Benq | 3368 |

5 | mnbvmar | 3280 |

6 | ecnerwala | 3278 |

7 | LHiC | 3276 |

8 | sunset | 3264 |

9 | maroonrk | 3159 |

10 | TLE | 3145 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 189 |

2 | Radewoosh | 177 |

3 | tourist | 173 |

4 | antontrygubO_o | 172 |

5 | Vovuh | 167 |

6 | PikMike | 166 |

7 | rng_58 | 157 |

8 | majk | 156 |

9 | farmersrice | 153 |

9 | Um_nik | 153 |

**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 !

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 . ?

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 ?

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 .**

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

i heard dicnic is easier to code

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

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

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

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

Please provide some good editorials and link on segment trees..

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/13/2019 04:12:43 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|