编程介的小学生 2017-02-26 12:01 采纳率: 20.5%
浏览 713
已采纳

Archaeologist's Trouble

Lazy Genius recently received a detailed map of a tomb. He believed that there should be some rare relics in the tomb.

As known to all, there are many lethal traps in the tomb, certainly, including the entrance door. If you break into the tomb, you might be killed. Well, don't worry since you have a computer to help you. The door has N locks. Beside the door, there are M switches. Each switch controls several locks. When you press one switch, the corresponding locks will change their status (locked->unlocked, unlocked->locked). If any lock changes its status more than three times, all the locks will lock up and can't be unlocked forever.

Lazy wants to open the door as soon as possible. Because of your excellent accomplishment in the previous missions, Lazy turned to you, believing that you could help him.

Input

The input contains several test cases, separately by a blank line in-between.

The first line of each case contains two integers, N (0 < N < 30) and M (0 < M < 60). Then M lines follow. Each line begins with an integer k, and then followed by k integers that indicate the locks controlled by one switch.

Output

For each test case, output in one line the least number of switchs that should be pressed to open the door. If such a number does not exist, print "~~~~><~~~~".

Sample Input

4 3
3 1 2 3
2 3 4
1 4

Sample Output

2

  • 写回答

2条回答 默认 最新

  • threenewbee 2017-03-04 14:41
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥15 求差集那个函数有问题,有无佬可以解决
  • ¥15 【提问】基于Invest的水源涵养
  • ¥20 微信网友居然可以通过vx号找到我绑的手机号
  • ¥15 寻一个支付宝扫码远程授权登录的软件助手app
  • ¥15 解riccati方程组
  • ¥15 display:none;样式在嵌套结构中的已设置了display样式的元素上不起作用?
  • ¥15 使用rabbitMQ 消息队列作为url源进行多线程爬取时,总有几个url没有处理的问题。
  • ¥15 Ubuntu在安装序列比对软件STAR时出现报错如何解决
  • ¥50 树莓派安卓APK系统签名
  • ¥65 汇编语言除法溢出问题