zeldris's blog

By zeldris, history, 3 years ago, In English

Hello. In the contest of my university fell the following problem: Given D (-1000 <= D <= 1000) the determinant of a 2x2 matrix, obtain the matrix that has this determinant and the 4 elements [a, b, c, d] such that a! = B! = C! = D and a, b, c, d! = 0

Any hint of how to do this without without O (n ^ 4)

Read more »

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

By zeldris, history, 3 years ago, In English

Hi everyone. I have a question about a combination with HLD and TREAP. Is it possible to rotate the path between (u, v)?

Read more »

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

By zeldris, history, 3 years ago, In English

Hello everyone

I'm writing a problem for a contest in my college, so I need generate a planar graph. I need to make sure the graph is planar. Is there any trick to generate such graphs?

Read more »

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

By zeldris, history, 3 years ago, In English

Hi,

I'm try to solve a problem about trees where I need make a range update. Someone can explain me how I do this?

Thx

Read more »

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

By zeldris, history, 3 years ago, In English

Hello,

I need to build a connected graph with 1e5 vertices and 4e5 edges, but when I try to create using rand () I can not get such a graph. can anybody help me?

P.S. the edges must be different.

Read more »

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