### Yuki726's blog

By Yuki726, history, 2 years ago,

Hi Guys, my submission 77409380 for this 1181D - Irrigation is getting TLE'd. Can anyone help me in finding my mistake.

• -21

By Yuki726, history, 2 years ago,

Find a pair in an array with maximum bitwise OR? $1 \leq n \leq 1e6, 0 \leq a[i] \leq 1e6$

Can anyone help me with the solution or finding a blog somewhere.

• +16

By Yuki726, history, 2 years ago,

Hi guys, I never really wrapped my head around floating point precision standards(in the view of competitive programming). Can you guys suggest me a book or course for me to read for a c++ beginner?

• +3

By Yuki726, history, 3 years ago,

Whomever are willing, comment their wannabe color and the time before they are gonna achieve it.

Note: Post the color you are actually practicing for past days. Please don't just spam red.

• +17

By Yuki726, history, 3 years ago,

Is there any plugin that hides number of submissions in contests BUT SORTS THE PROBLEMS BASED ON SUBMISSIONS? During contests If I see number of submissions I either lose confidence or get over confident, so I just want to see the order in which I need to solve.

• -8

By Yuki726, history, 3 years ago,

Can anyone tell me where can I find good list of adhoc competitive programming problems? I want to practice problems which doesn't contain textbook algorithms.

• +31

By Yuki726, history, 3 years ago,

There are approximately 35 mid heroes in dota 2. You are given a matrix winprob[35][35], where winprob[i][j] denotes the probability of ith hero winning against jth hero in midlane (matrix is derived from previously played games).
Problem : What's the minimum cardinal subset of heroes (to learn) such that when the opponent picks a mid hero, we can always pick a hero from our subset and get the probability of winning atleast (60%).

I can only think of bruteforce. Is there any better algorithm?

• +40

By Yuki726, history, 3 years ago,

Are Ladders still consistent with their corresponding ratings?

• +7

By Yuki726, history, 3 years ago,

In this submission for the problem 31660028 the author used if(ans[ni][nj] < ans[v.fi][v.se] + 1) break; condition. Can anyone guide me in proving that this algorithm with the break condition produces shortest paths and its complexity is O(n*m).