I am stuck on 8C .Can anyone suggest me how to solve this problem ..?

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

1 | tourist | 3882 |

2 | maroonrk | 3539 |

3 | Benq | 3513 |

4 | MiracleFaFa | 3466 |

5 | ksun48 | 3462 |

6 | ecnerwala | 3446 |

7 | slime | 3428 |

8 | Um_nik | 3426 |

9 | jiangly | 3401 |

10 | greenheadstrange | 3393 |

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

1 | awoo | 192 |

2 | -is-this-fft- | 191 |

3 | Monogon | 185 |

4 | Um_nik | 182 |

4 | YouKn0wWho | 182 |

6 | maroonrk | 169 |

7 | antontrygubO_o | 167 |

8 | errorgorn | 166 |

9 | kostka | 165 |

9 | SecondThread | 165 |

I am stuck on 8C .Can anyone suggest me how to solve this problem ..?

↑

↓

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/20/2022 11:38:40 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

Please anybody help ..!!

Refer to tutorial for solution

Abe hagode .!! What could i found is this editorial and in this blog , solution for only D & E is published . If you are talking about another tutorial ,please let me know !!

Like the tags of the problem indicate, it's solved by using bitmasks and DP.

^{0}+ 2^{3}+ 2^{5}). The size of the DP array will then be 2^{24}.^{N}- 1 seeing if adding one or two objects to this state yields a better solution than what you currently have. The cost of adding two objects i and j (potentially the same) isDist[H][i] +Dist[i][j] +Dist[j][H], where H is the handbag.Dist[i][j] = (x[i] -x[j])^{2}+ (y[i] -y[j])^{2}.Cost[i][i] = 0, obviously.From[y] =x).Thank You diego_v1 :)