{"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":"","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003e飞行棋大家肯定不陌生,不过为了简化题目,我们稍微改一改规则。\u003c/p\u003e \n\u003cp\u003e假设有一个无限大的二维矩阵。例如下图,如果我们初始位置位于黄点,则红色轨迹是我们的能够行进的路线:\u003c/p\u003e\n\u003cp\u003e\u003cimg alt\u003d\"\" src\u003d\"CDN_BASE_URL/a8141d845894fa57ced44db727684a9d?v\u003d1638966890\" width\u003d\"320\" height\u003d\"320\"\u003e\u003c/p\u003e \n\u003cp\u003e更正式地说,如果我们使得以下三项中最少有一项成立时,我们能从当初始位置 (a,b)一次跳转到位置(c,d) \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\u003cli\u003e以上三项我们每次只能选择任意一项进行执行,也就是棋子每满足此式子中一项就跳转一次。\n\u003c/ul\u003e \n\u003cp\u003e现在请你找出棋子从 (a,b) 到达 (c,d) 所需的最小移动次数。\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"输入数据范围如下:\n\u003ch3\u003e\u003c/h3\u003e\n\u003ch3\u003e\u003c/h3\u003e\n\u003cul\u003e\n \u003cli\u003e所有输入的数都是整数\u003c/li\u003e \n \u003cli\u003e\u003cvar\u003e\\(1 \\le a, b, c, d \\le 10^9\\)\u003c/var\u003e\u003c/li\u003e \n\u003c/ul\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\n"}},{"title":"Output","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003e找到该棋子从(a,b)移动到(c,d)所需要的最少次数。\u003c/p\u003e"}},{"title":"Sample Input 1","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e1 1\n1 1\n\u003c/pre\u003e"}},{"title":"Sample Output 1","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e0\n\u003c/pre\u003e"}},{"title":"Sample Input 2","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e1 1\n5 6\n\u003c/pre\u003e"}},{"title":"Sample Output 2","value":{"format":"HTML","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 3","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e1 1\n1 200001\n\u003c/pre\u003e"}},{"title":"Sample Output 3","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e2\n\u003c/pre\u003e "}},{"title":"Sample Input 4","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e2 3\n998244353 998244853\n\u003c/pre\u003e"}},{"title":"Sample Output 4","value":{"format":"HTML","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"}}]}