Comments
+30

its still not working.scoreboard is loading....
0

is this a div2 kinda round? this is gonna be my first actual contest on topcoder.
0

@Vovuh How is ur editorial of F2 different from this? . Aren't they same?

0

Did u apply parallelism on the flattened array? then how do u cover the vertices that are occuring exactly twice in that range.
+8

Thanks! This is quite a good trick
0

Is Pika-Pika about flattening the tree and then using Mo's algorithm / sqrt-decomposition along with binary indexed tree to calculate the required prefix sum using binary search? Is O(n * sqrt(n) * logn) accepted for these constraints?
+1

Can F2 be solved by finding articulation edges / bridges in the graph and as soon as we find bridge edge we merge them and after that we pick any random adjacent edges of vertex 1 so as to make its degree exactly d. and after make the whole tree connected using kruskal type algorithm? Here is my submission for reference of what i am talking. I am getting wrong answer on test 37. Pls tell if i am wrong. Thanks
0

Can F2 be solved by finding articulation edges / bridges in the graph and as soon as we find bridge edge we merge them and after that we pick any random adjacent edges of vertex 1 so as to make its degree exactly d. and after make the whole tree connected using kruskal type algorithm? Here is my submission for reference of what i am talking. Pls tell if i am wrong. Thanks
On Errichto → AtCoder DP Stream, 7 years ago
+16

It would be great if u add the timestamps (time at which u start solving a particular question) in the youtube description section after u end the stream.
0

Thanks a lot. Now i got it.
0

Jakube why u have divided the no of guesses by 3? i ain't able to get this.
+3

Thanks a lot for exhaustive explanation!
+40

why you are asking the solution for a problem from the on-going contest? let it be finish first
+10

Can anyone please explain how to solve problem-W Intervals? It's been too long and i ain't able to solve it. Thanks
0

Ohh Thanks! I am starting to get some intuition for that. Pls share ur code too for more clearity.

+5

same for m3 too
0

For E: Store the frequency of each topic in array and sort that array. Then let say we fix the no of topics in first contest be i, then binary search on this array to find if there exists a topic with frequency greater than i, if yes then take the leftmost topic and set it as new index (initially index is 0) and then check for 2 * i and repeat the process. If not found, just break at that index. Repeat the process for new i. Code: http://mirror.codeforces.com/contest/1077/submission/45834476
+1

I have solved this greedily using priority queue with sorting on the basis on how much more copies of a number we can get if select the current number since we have to maximize the minimum frequency of taken number Code: http://mirror.codeforces.com/contest/1077/submission/45823855
+5

What we need to find is the number which have (n + 1) / 2 numbers less than it in that range where n is the size of submatrix. This can be done using 2D frequency sums of each number(<= 500) and then using another 3D matrix, dp[k][i][j] which denotes no of numbers less than equal to k in the range [1,1] to [i,j]. This matrix along with binary search produce the required answer. https://ideone.com/EnCunm
On eidan → Codechef March Lunctime 2018, 8 years ago
+3

Hope it gets back until your lunch time xD
On eidan → Codechef March Lunctime 2018, 8 years ago
0

Not yet..Seems they have problem with the servers!
0

Does anyone know abt any online visualizer for geometry problems? like ploting circle and even any conics
0

Really Happy to solve problem E !! Cheers