L. Icy Rider

Codeforces

IDCF10046L

Time2000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

Where it's always a severe frost and howling blizzards, world-weary Icy Rider lives. Icy Rider will never die, will never melt, cannot move and cannot do anything at all. All what is left for him are his memories. Before his way was ended, the Rider was forced to live through n events, in which m people took part. Each person is characterized by the relation of the Rider to this person — the integer from 1 to 109. The relation of the Rider to the event is the maximum of relations of the Rider to the people who took part in this event. It's known how the Rider relates to each of n events and also who exactly took part in which event. It's required to find out how the Rider relates to each of the m people. The first line contains two integers separated by the space: n and m (1 ≤ n, m ≤ 105) — the number of events memorable for Ice Rider and the number of people took part in these events. It is guaranteed that nm ≤ 106. The next 2n lines contain the description of the events. In the -th line there are two integers separated by the space: ki and ci (1 ≤ ki ≤ m, 1 ≤ ci ≤ 109) — the total number of people took part in the i-th event and the relation of the Rider to this event. In the -th line there are ki integers separated by the spaces: pij (1 ≤ pij ≤ m) — the numbers of people who took part in the i-th event. For each certain event all the pij are distinct. In the first line output «_Good memory_» (without quotes) if there exists at least one answer. In this case in the second line output m integers from 1 to 109 separated by the spaces — the relation of the Rider to the corresponding people. If there are multiple answers, output any of them. In the case the Rider got it wrong and no answer exists, in the only line output «_Poor memory_» (without quotes). ## Input The first line contains two integers separated by the space: n and m (1 ≤ n, m ≤ 105) — the number of events memorable for Ice Rider and the number of people took part in these events. It is guaranteed that nm ≤ 106.The next 2n lines contain the description of the events. In the -th line there are two integers separated by the space: ki and ci (1 ≤ ki ≤ m, 1 ≤ ci ≤ 109) — the total number of people took part in the i-th event and the relation of the Rider to this event. In the -th line there are ki integers separated by the spaces: pij (1 ≤ pij ≤ m) — the numbers of people who took part in the i-th event. For each certain event all the pij are distinct. ## Output In the first line output «_Good memory_» (without quotes) if there exists at least one answer. In this case in the second line output m integers from 1 to 109 separated by the spaces — the relation of the Rider to the corresponding people. If there are multiple answers, output any of them. In the case the Rider got it wrong and no answer exists, in the only line output «_Poor memory_» (without quotes). [samples]

**Definitions** Let $ n, m \in \mathbb{Z}^+ $ be the number of events and people, respectively. Let $ E_i = (k_i, c_i, P_i) $ for $ i \in \{1, \dots, n\} $, where: - $ k_i \in \mathbb{Z}^+ $ is the number of participants in event $ i $, - $ c_i \in \mathbb{Z}^+ $ is the Rider’s relation to event $ i $, - $ P_i = \{p_{i1}, p_{i2}, \dots, p_{ik_i}\} \subseteq \{1, \dots, m\} $ is the set of participants in event $ i $. Let $ x_j \in \mathbb{Z}^+ $ denote the Rider’s relation to person $ j \in \{1, \dots, m\} $. **Constraints** For each event $ i \in \{1, \dots, n\} $: $$ \max_{j \in P_i} x_j = c_i $$ and for all $ j \in \{1, \dots, m\} $: $$ 1 \le x_j \le 10^9 $$ **Objective** Determine if there exists a vector $ \mathbf{x} = (x_1, \dots, x_m) $ satisfying all constraints. If yes, output "Good memory" followed by any such $ \mathbf{x} $. If no, output "Poor memory".

API Response (JSON)

{
  "problem": {
    "name": "L. Icy Rider",
    "description": {
      "content": "Where it's always a severe frost and howling blizzards, world-weary Icy Rider lives. Icy Rider will never die, will never melt, cannot move and cannot do anything at all. All what is left for him are ",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10046L"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Where it's always a severe frost and howling blizzards, world-weary Icy Rider lives. Icy Rider will never die, will never melt, cannot move and cannot do anything at all. All what is left for him are ...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n, m \\in \\mathbb{Z}^+ $ be the number of events and people, respectively.  \nLet $ E_i = (k_i, c_i, P_i) $ for $ i \\in \\{1, \\dots, n\\} $, where:  \n- $ k_i \\in \\mathbb{Z}^+ $ is ...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments