Swaps

AtCoder

IDnikkei2019_2_qual_c

Time2000ms

Memory256MB

Difficulty—

Given are two integer sequences of $N$ elements each: $A_1,...,A_N$ and $B_1,...,B_N$. Determine if it is possible to do the following operation at most $N-2$ times (possibly zero) so that, for every integer $i$ from $1$ to $N$, $A_i \leq B_i$ holds: * Choose two distinct integers $x$ and $y$ between $1$ and $N$ (inclusive), and swap the values of $A_x$ and $A_y$. ## Constraints * $2 \leq N \leq 10^5$ * $1 \leq A_i,B_i \leq 10^9$ ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $A_2$ $...$ $A_N$ $B_1$ $B_2$ $...$ $B_N$ [samples]

Samples

Input #1

3
1 3 2
1 2 3

Output #1

Yes

We should swap the values of $A_2$ and $A_3$.

Input #2

3
1 2 3
2 2 2

Output #2

No

Input #3

6
3 1 2 6 3 4
2 2 8 3 4 3

Output #3

Yes

API Response (JSON)

{
  "problem": {
    "name": "Swaps",
    "description": {
      "content": "Given are two integer sequences of $N$ elements each: $A_1,...,A_N$ and $B_1,...,B_N$. Determine if it is possible to do the following operation at most $N-2$ times (possibly zero) so that, for every ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "nikkei2019_2_qual_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given are two integer sequences of $N$ elements each: $A_1,...,A_N$ and $B_1,...,B_N$. Determine if it is possible to do the following operation at most $N-2$ times (possibly zero) so that, for every ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments