Necklace

TimeLimit:1500MS  MemoryLimit:65536KB
64-bit integer IO format:%I64d
未提交 | 登录后收藏
Problem Description
SJX has 2*N magic gems. $N$ of them have Yin energy inside while others have Yang energy. SJX wants to make a necklace with these magic gems for his beloved BHB. To avoid making the necklace too Yin or too Yang, he must place these magic gems Yin after Yang and Yang after Yin, which means two adjacent gems must have different kind of energy. But he finds that some gems with Yang energy will become somber adjacent with some of the Yin gems and impact the value of the neckless. After trying multiple times, he finds out M rules of the gems. He wants to have a most valuable neckless which means the somber gems must be as less as possible. So he wonders how many gems with Yang energy will become somber if he make the necklace in the best way.
Input
  Multiple test cases.

  For each test case, the first line contains two integers $N (0 \leq N \leq 9), M (0 \leq M \leq N * N)$, descripted as above.

  Then $M$ lines followed, every line contains two integers $X,Y$, indicates that magic gem $X$ with Yang energy will become somber adjacent with the magic gem $Y$ with Yin energy.
Output
One line per case, an integer indicates that how many gem will become somber at least.
SampleInput
2 1
1 1
3 4
1 1
1 2
1 3
2 1
SampleOutput
1
1
Submit
题目统计信息详细
总AC数3
通过人数2
尝试人数4
总提交量7
AC率28.57%
AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题,请不要查看标签
如果您已经通过了该题,请务为该题贴上标签

T^T Online Judge

[BUG反馈] [FAQ] [闽ICP备17026590号-1]
当前版本:3.24 系统时间: