Yuki726's blog

By Yuki726, history, 3 weeks ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it
  • -8
  • Vote: I do not like it

By Yuki726, history, 5 weeks ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it
  • +31
  • Vote: I do not like it

By Yuki726, history, 6 weeks ago, In English,

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?

Read more »

 
 
 
 
  • Vote: I like it
  • +40
  • Vote: I do not like it

By Yuki726, history, 2 months ago, In English,

Are Ladders still consistent with their corresponding ratings?

Read more »

 
 
 
 
  • Vote: I like it
  • +7
  • Vote: I do not like it

By Yuki726, history, 3 months ago, In English,

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

Problem Link: https://codeforces.com/problemset/problem/877/D

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it