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

1 | tourist | 3698 |

2 | Petr | 3381 |

3 | mnbvmar | 3379 |

4 | Benq | 3339 |

5 | wxhtxdy | 3329 |

6 | LHiC | 3303 |

7 | ecnerwala | 3300 |

8 | sunset | 3278 |

9 | V--o_o--V | 3275 |

10 | Um_nik | 3240 |

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

1 | Radewoosh | 185 |

2 | Errichto | 183 |

3 | rng_58 | 162 |

4 | PikMike | 159 |

5 | Vovuh | 157 |

6 | Petr | 156 |

7 | 300iq | 153 |

8 | majk | 148 |

9 | Um_nik | 147 |

10 | Swistakk | 145 |

Hello,

Can anyone help me with a tutorial for this problem?

I had an idea using binary search. We can sort the array, then each time we look for the next nearest point using binary search. After that we remove that point from the points list and then we look for the next nearest point and so on. But the drawback is the 'erase' step, which takes O(N) complexity. That changes overall complexity from O(N log N) to O(N * [log N + N]) which is O(N^2).

So any help here please?

Hi, I hope this blog entry finds you well and you are doing fine,

I was wondering if somebody can share with us a simple tutorial for the problem above. There doesn't exist a tutorial for this round.

Hello,

Here is the problem link.

Here is my submission.

I am applying lazy propagation but I don't know why I got TLE. Any help?

Hi,

I have just watched a tutorial about "Bits". I need to solve some easy problems so I can increase my understanding for bits. I've noticed that many CF rounds involve bits problems, and I couldn't solve a single one during the rounds.

If you know some problem(s), please comment with them. Also, if I need to revise some topics, please comment with them too.

Thanks in advance.

Hi.

I was trying to solve this problem. Here is the problem link.

If n = 4, k = 0, the apples are of weight 1, 2, 3, 4.

If he eats apple #1:

If apple #1 is sweet, then he must eat apples of total weight 1.

If apple #2 is sweet, then the total weight is 3.

If apple #3 is sweet, then the total weight is 6.

If apple #4 is the sweet one, then he must must eat apples of total weight 6 also.(because he will know the answer regardless of the taste of apple #3)

Then we have total answer of: 1 + 3 + 6 + 6 = 16.

Why the answer in this case is equal to 13?

Thanks in advance.

Hi.

I'm looking for DP problems that involve printing the items that give the optimal answer(involves reconstructing the optimal items), like printing the Knapsack items for example.

If you know any similar problems, please comment with them.

Thanks in advance.

Hi,

I got WA for this problem. I hope that you can help me.

Problem Link: http://www.spoj.com/problems/FP/

My idea is sorting the numbers in non-increasing order, then applying (0/1) logic, either I take the element, or I leave it.

My code: http://ideone.com/wJaQoR

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/26/2019 21:30:39 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|