CF1423L.Light switches

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Nikola owns a large warehouse which is illuminated by NN light bulbs, numbered 11 to NN . At the exit of the warehouse, there are SS light switches, numbered 11 to SS . Each switch swaps the on/off state for some light bulbs, so if a light bulb is off, flipping the switch turns it on, and if the light bulb is on, flipping the switch turns it off.

At the end of the day, Nikola wants to turn all the lights off. To achieve this, he will flip some of the light switches at the exit of the warehouse, but since Nikola is lazy, he wants to flip the _minimum_ number of switches required to turn all the lights off. Since Nikola was not able to calculate the minimum number of switches, he asked you to help him. During a period of DD days, Nikola noted which light bulbs were off and which were on at the end of each day. He wants you to tell him the minimum number of switches he needed to flip to turn all the lights off for each of the DD days or tell him that it's impossible.

输入格式

First line contains three integers, NN , SS and DD ( 1N1031 \leq N \leq 10^3 , 1S301 \leq S \leq 30 , 1D1031 \leq D \leq 10^3 ) – representing number of light bulbs, the number of light switches, and the number of days respectively.

The next SS lines contain the description of each light switch as follows: The first number in the line, CiC_i ( 1CiN1 \leq C_i \leq N ), represents the number of light bulbs for which the on/off state is swapped by light switch ii , the next CiC_i numbers (sorted in increasing order) represent the indices of those light bulbs.

The next DD lines contain the description of light bulbs for each day as follows: The first number in the line, TiT_i ( 1TiN1 \leq T_i \leq N ), represents the number of light bulbs which are on at the end of day ii , the next TiT_i numbers (sorted in increasing order) represent the indices of those light bulbs.

输出格式

Print DD lines, one for each day. In the ithi^{th} line, print the minimum number of switches that need to be flipped on day ii , or 1-1 if it's impossible to turn all the lights off.

输入输出样例

  • 输入#1

    4 3 4
    2 1 2
    2 2 3
    1 2
    1 1
    2 1 3
    3 1 2 3
    3 1 2 4

    输出#1

    2
    2
    3
    -1
首页