Hi,

Since nobody has mentioned this SRM, I do that here:

Time.

I am not the author, just want to increase the number of participants.

Thanks!

# | User | Rating |
---|---|---|

1 | Petr | 3325 |

2 | OO0OOO00O0OOO0O0…O | 3289 |

3 | Um_nik | 3278 |

4 | Syloviaely | 3274 |

5 | tourist | 3206 |

6 | Radewoosh | 3197 |

7 | V--o_o--V | 3167 |

8 | mnbvmar | 3096 |

9 | dotorya | 3086 |

10 | FizzyDavid | 3023 |

# | User | Contrib. |
---|---|---|

1 | tourist | 183 |

2 | rng_58 | 168 |

3 | csacademy | 160 |

3 | Petr | 160 |

5 | lewin | 151 |

6 | Swistakk | 150 |

7 | matthew99 | 142 |

8 | BledDest | 141 |

9 | Errichto | 140 |

10 | adamant | 139 |

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/23/2018 09:01:10 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|

Can anyone tell me what can be done when the applet says "A connection to the server cannot be established" when I try to login? I tried autodetect, it doesn't work. It was working well a few weeks back.

download the applet again. usually works for me.

Tried that. Still doesn't work :|

Thank you so much for posting this! I always miss SRMs, and finally get to compete in one. GLHF everyone!

Does anyone have proved solution for 1000?

How to solve medium? (I have

O(k^{3}) with small constant which gets AC in 1.6s)up_{i}is an expected sum of heights of nodes in tree withinodes.dp_{i}is an expected sum of length of paths in tree withinodes.by linearity of expectation.

Similary, because sum of length is sum of length in both subtrees and sum of length of paths going through root.

About Div1 Hard.

My solution was to look at only Pareto-optimal choices. First, we sort the friends by decreasing number of bits set. After that, we recursively pick or kick them in that order. The single important check which makes it run faster than like 256

^{8}is as follows: if we kick a friendX, we also have to kick all further friends which have a subset ofX's skills (otherwise, the choice wouldn't be Pareto-optimal).In practice run, this takes <100ms on all the given tests. Can someone please either construct a test where this becomes slow, or prove a reasonable asymptotic bound for the number of Pareto-optimal choices?

What about all (

C(8, 4)) masks with 4 bits? Then it will be like 70^{8}?Challenge succeeded :) .

A pity you were not in my room.

I wanted to challenge you with this exact test..

However, I was so stupid that I did not know paste in TC is ctrl+v (while in macOS is it command + v). :P

On all vectors with 4 1-bits out of 8 it will be 70

^{8}/ 8! ≈ 10^{10}can someone explain how to solve "div1 easy"? making second tree by removing edge from first tree.

how to solve div2b