PouyaNavid's blog

By PouyaNavid, history, 16 months ago, In English

Hi,

Consider a rooted tree

size(v) = number of vertices in subtree of v

Any good limit on $$$\sum_{i=1}^{n} $$$$$$\sqrt{size(i)}$$$ ?

like

$$$O(n \log n)$$$

$$$O(n \log \log n)$$$

$$$O(n)$$$

...

UPD :

b(v) is a son of v with the largest subtree size.

limit on $$$\sum_{i=1}^{n} $$$$$$\sqrt{size(i) - size(b(i))}$$$ ?

Read more »

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

By PouyaNavid, history, 17 months ago, In English

Hi,

Can anyone tell me why this randomize solution is correct ?

Problem : 1176E - Cover it!
Problem statement : You are given an undirected unweighted connected graph consisting of n vertices and m edges. It is guaranteed that there are no self-loops or multiple edges in the given graph. Your task is to choose at most \lfloor\frac{n}{2}\rfloor vertices in this graph so each unchosen vertex is adjacent (in other words, connected by an edge) to at least one of chosen vertices.
Solution : 62626593

Read more »

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

By PouyaNavid, 19 months ago, In English

Hi,

How Can we print the k pairs in 700B - Connecting Universities ?

Read more »

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

By PouyaNavid, history, 19 months ago, In English

Hello,

Can we print the pairs in 1280 C ?

Read more »

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