0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-05 16:18:48 +00:00
OI-codes/Luogu/problem/P7885/P7885.cpp
2021-10-02 07:15:16 +08:00

17 lines
318 B
C++

#include <bits/stdc++.h>
using namespace std;
long long t, a, b, c, d, x, y, k;
int main() {
cin >> t;
while (t--) {
cin >> a >> b >> c >> d;
x = abs(a - c);
y = abs(b - d);
cout << max(x, y) * 2 - !(x % 2 == 0 && y % 2 == 0 || x % 2 && y % 2) << endl;
}
return 0;
}