Блог пользователя dca

Автор dca, 3 года назад, По-английски

I am sorry if this is too early. But I got curious after I saw the contest named — "AtCoder Grand Contest 050 (Good Bye rng_58 Day 1)" on Atcoder which is scheduled on 26th December. Does that mean rng_58 is leaving Atcoder?
P.S.- Sorry for unnecessary tagging

Полный текст и комментарии »

  • Проголосовать: нравится
  • +62
  • Проголосовать: не нравится

Автор dca, 4 года назад, По-английски

I was going through this paper for understanding the algorithm for k dimensional euclidean mst. I am not getting, how to implement this. How do I choose arbitrary C1 for building grid.(Given on Page 4) Here is the algorithm for EMST given-

for every point p ∈ V do Identify the set Q of points that are within a distance of √C1/n from p (for some constant C1 > 1). Q is identified using the grid that has been created Can anyone help in this. Also, I could not get enough articles/posts regarding this topic other than research papers. Please share if you have some resources for this topic.

I previously asked the same 2 days ago, but couldn't figure why I received downvotes. I didn't knew it was from ongoing contest. I apologize for that. Now that the contest is over, can someone tell this.

Полный текст и комментарии »

  • Проголосовать: нравится
  • +23
  • Проголосовать: не нравится

Автор dca, 4 года назад, По-английски

I was going through this paper for understanding the algorithm for k dimensional euclidean mst. I am not getting, how to implement this. How do I choose arbitrary C1 for building grid.(Given on Page 4)
Here is the algorithm for EMST given-

for every point p ∈ V do
Identify the set Q of points that are within a distance of
√C1/n from p (for some constant C1 > 1).
Q is identified using the grid that has been created

Can anyone help in this. Also, I could not get enough articles/posts regarding this topic other than research papers. Please share if you have some resources for this topic.

Полный текст и комментарии »

  • Проголосовать: нравится
  • -12
  • Проголосовать: не нравится

Автор dca, история, 4 года назад, По-английски

I am given an integer array $$$A$$$ of size $$$N$$$. I want to make a multiset from $$$A$$$ such that, if any two elements of the multiset are multiplied, the product should not be a perfect cube. What is the maximum size of the multiset? I can only think of the bruteforce approach. Can we solve it in some efficient way? For example, if A=[1,2,4]. We can create a multiset M=[1,2]. As multiplication of 1*2 is not a cube. Similarly, M can also be [1,4], but not [1,2,4] as 2*4=8, is a cubic number. $$$N<=1000$$$, $$$1$$$ $$$<=Ai<=$$$ $$$10^6$$$

Полный текст и комментарии »

  • Проголосовать: нравится
  • +5
  • Проголосовать: не нравится