{"problem":{"name":"Choose Elements","description":{"content":"You are given two sequences, each of length $N$, consisting of integers: $A=(A_1, \\ldots, A_N)$ and $B=(B_1, \\ldots, B_N)$. Determine whether there is a sequence of length $N$, $X=(X_1, \\ldots, X_N)$,","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc245_c"},"statements":[{"statement_type":"Markdown","content":"You are given two sequences, each of length $N$, consisting of integers: $A=(A_1, \\ldots, A_N)$ and $B=(B_1, \\ldots, B_N)$.\nDetermine whether there is a sequence of length $N$, $X=(X_1, \\ldots, X_N)$, satisfying all of the conditions below.\n\n*   $X_i = A_i$ or $X_i = B_i$, for every $i(1\\leq i\\leq N)$.\n    \n*   $|X_i - X_{i+1}| \\leq K$, for every $i(1\\leq i\\leq N-1)$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2\\times 10^5$\n*   $0 \\leq K \\leq 10^9$\n*   $1 \\leq A_i,B_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$B_1$ $\\ldots$ $B_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc245_c","tags":[],"sample_group":[["5 4\n9 8 3 7 2\n1 6 2 9 5","Yes\n\n$X=(9,6,3,7,5)$ satisfies all conditions."],["4 90\n1 1 1 100\n1 2 3 100","No\n\nNo $X$ satisfies all conditions."],["4 1000000000\n1 1 1000000000 1000000000\n1 1000000000 1 1000000000","Yes"]],"created_at":"2026-03-03 11:01:14"}}