Codeforces 808F Card Game【思维建图+最小割】

mengxiang000000

于 2017-05-25 13:21:53 发布

阅读量1.1k

点赞数

分类专栏：网络流相关思维文章标签： Codeforces 808F

本文链接：https://blog.csdn.net/mengxiang000000/article/details/72724480

版权

Vova想要构建一个总力量不低于k的卡片组，但魔法数字的组合必须避免形成质数。他需要达到至少什么等级才能做到？二分搜索和最小割模型用于解决这个问题。

摘要由CSDN通过智能技术生成

Digital collectible card games have become very popular recently. So Vova decided to try one of these.

Vova has n cards in his collection. Each of these cards is characterised by its power p_i, magic number c_i and level l_i. Vova wants to build a deck with total power not less than k, but magic numbers may not allow him to do so — Vova can't place two cards in a deck if the sum of the magic numbers written on these cards is a prime number. Also Vova cannot use a card if its level is greater than the level of Vova's character.

At the moment Vova's character's level is 1. Help Vova to determine the minimum level he needs to reach in order to build a deck with the required total power.

Input

The first line contains two integers n and k (1 ≤ n ≤ 100, 1 ≤