Bowls and Dishes

AtCoder

IDabc190_c

Time2000ms

Memory256MB

Difficulty—

We have $N$ dishes numbered $1, 2, \dots, N$ and $M$ conditions numbered $1, 2, \dots, M$. Condition $i$ is satisfied when both Dish $A_i$ and Dish $B_i$ have (one or more) balls on them. There are $K$ people numbered $1, 2, \dots, K$. Person $i$ will put a ball on Dish $C_i$ or Dish $D_i$. At most how many conditions will be satisfied? ## Constraints * All values in input are integers. * $2 ≤ N ≤ 100$ * $1 ≤ M ≤ 100$ * $1 ≤ A_i < B_i ≤ N$ * $1 ≤ K ≤ 16$ * $1 ≤ C_i < D_i ≤ N$ ## Input Input is given from Standard Input in the following format: $N$ $M$ $A_1$ $B_1$ $\vdots$ $A_M$ $B_M$ $K$ $C_1$ $D_1$ $\vdots$ $C_K$ $D_K$ [samples]

Samples

Input #1

Output #1

2

For example, if People $1, 2, 3$ put their balls on Dishes $1, 3, 2$, respectively, Conditions $1$ and $2$ will be satisfied.

Input #2

Output #2

4

For example, if People $1, 2, 3, 4$ put their balls on Dishes $3, 1, 2, 4$, respectively, all conditions will be satisfied.

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Bowls and Dishes",
    "description": {
      "content": "We have $N$ dishes numbered $1, 2, \\dots, N$ and $M$ conditions numbered $1, 2, \\dots, M$.   Condition $i$ is satisfied when both Dish $A_i$ and Dish $B_i$ have (one or more) balls on them.   There ar",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc190_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have $N$ dishes numbered $1, 2, \\dots, N$ and $M$ conditions numbered $1, 2, \\dots, M$.  \nCondition $i$ is satisfied when both Dish $A_i$ and Dish $B_i$ have (one or more) balls on them.  \nThere ar...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments