{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Problem Statement","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003e这是一个无限的二维网格,我们有一个叫做超级龙马的棋子 \u003cvar\u003e\\((r_1, c_1)\\)\u003c/var\u003e. \u003cem\u003e\u003c/em\u003e 在一次移动中,超级龙马可以移动到如下所示的格子之一:\u003c/p\u003e \n\u003cp\u003e\u003cimg alt\u003d\"\" src\u003d\"CDN_BASE_URL/a8141d845894fa57ced44db727684a9d?v\u003d1635233381\" width\u003d\"320\" height\u003d\"320\"\u003e\u003c/p\u003e \n\u003cp\u003e更准确地说,当超级龙马处于格子\u003cvar\u003e\\((a, b)\\)\u003c/var\u003e时, 它可以移动到格子 \u003cvar\u003e\\((c, d)\\)\u003c/var\u003e 至少满足以下一种情况:\u003c/p\u003e \n\u003cul\u003e \n \u003cli\u003e\u003cvar\u003e\\(a + b \u003d c + d\\)\u003c/var\u003e\u003c/li\u003e \n \u003cli\u003e\u003cvar\u003e\\(a - b \u003d c - d\\)\u003c/var\u003e\u003c/li\u003e \n \u003cli\u003e\u003cvar\u003e\\(|a - c| + |b - d| \\le 3\\)\u003c/var\u003e\u003c/li\u003e \n\u003c/ul\u003e \n\u003cp\u003e求出超级龙马从\u003cvar\u003e\\((r_1, c_1)\\)\u003c/var\u003e 到 \u003cvar\u003e\\((r_2, c_2)\\)\u003c/var\u003e 所需的最少步数。\u003c/p\u003e"}},{"title":"Constraints","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cul\u003e \n \u003cli\u003e输入的值都是整数。\u003c/li\u003e \n \u003cli\u003e\u003cvar\u003e\\(1 \\le r_1, c_1, r_2, c_2 \\le 10^9\\)\u003c/var\u003e\u003c/li\u003e \n\u003c/ul\u003e"}},{"title":"Input","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003e输入由标准输入提供,格式如下:\u003c/p\u003e \n\u003cpre\u003e\u003cvar\u003e\\(r_1\\)\u003c/var\u003e \u003cvar\u003e\\(c_1\\)\u003c/var\u003e\n\u003cvar\u003e\\(r_2\\)\u003c/var\u003e \u003cvar\u003e\\(c_2\\)\u003c/var\u003e\n\u003c/pre\u003e"}},{"title":"Output","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003e求出超级龙马从\u003cvar\u003e\\((r_1, c_1)\\)\u003c/var\u003e 到 \u003cvar\u003e\\((r_2, c_2)\\)\u003c/var\u003e 所需的最少步数。\u003c/p\u003e"}},{"title":"Sample Input 1","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e1 1\n5 6\n\u003c/pre\u003e"}},{"title":"Sample Output 1","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e2\n\u003c/pre\u003e \n\u003cp\u003e我们需要两步,例如, \u003cvar\u003e\\((1, 1) \\rightarrow (5, 5) \\rightarrow (5, 6)\\)\u003c/var\u003e.\u003c/p\u003e"}},{"title":"Sample Input 2","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e1 1\n1 200001\n\u003c/pre\u003e"}},{"title":"Sample Output 2","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e2\n\u003c/pre\u003e \n\u003cp\u003e我们需要两步,例如,\u003cvar\u003e\\((1, 1) \\rightarrow (100001, 100001) \\rightarrow (1, 200001)\\)\u003c/var\u003e.\u003c/p\u003e"}},{"title":"Sample Input 3","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e2 3\n998244353 998244853\n\u003c/pre\u003e"}},{"title":"Sample Output 3","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e3\n\u003c/pre\u003e \n\u003cp\u003e我们需要三步,例如,\u003cvar\u003e\\((2, 3) \\rightarrow (3, 3) \\rightarrow (-247, 253) \\rightarrow (998244353, 998244853)\\)\u003c/var\u003e.\u003c/p\u003e"}},{"title":"Sample Input 4","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e1 1\n1 1\n\u003c/pre\u003e"}},{"title":"Sample Output 4","value":{"format":"MD","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e0\n\u003c/pre\u003e"}}]}