{"problem":{"name":"K Swap","description":{"content":"We have a sequence of length $N$: $A=(a_1,\\ldots,a_N)$. Additionally, you are given an integer $K$. You can perform the following operation zero or more times. *   Choose an integer $i$ such that $1 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc254_c"},"statements":[{"statement_type":"Markdown","content":"We have a sequence of length $N$: $A=(a_1,\\ldots,a_N)$. Additionally, you are given an integer $K$.\nYou can perform the following operation zero or more times.\n\n*   Choose an integer $i$ such that $1 \\leq i \\leq N-K$, then swap the values of $a_i$ and $a_{i+K}$.\n\nDetermine whether it is possible to sort $A$ in ascending order.\n\n## Constraints\n\n*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq K \\leq N-1$\n*   $1 \\leq a_i \\leq 10^9$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$a_1$ $\\ldots$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc254_c","tags":[],"sample_group":[["5 2\n3 4 1 3 4","Yes\n\nThe following sequence of operations sorts $A$ in ascending order.\n\n*   Choose $i=1$ to swap the values of $a_1$ and $a_3$. $A$ is now $(1,4,3,3,4)$.\n*   Choose $i=2$ to swap the values of $a_2$ and $a_4$. $A$ is now $(1,3,3,4,4)$."],["5 3\n3 4 1 3 4","No"],["7 5\n1 2 3 4 5 5 10","Yes\n\nNo operations may be needed."]],"created_at":"2026-03-03 11:01:14"}}