text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long me(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
c_p_c();
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long minn = 1e17;
long long maxx = -1;
for (long long i = 0; i < n; i++) {
long long x;
long long y;
cin >> x >> y;
if (minn > y) {
minn = y;
}
if (maxx < x) {
maxx = x;
}
}
long long x1 = maxx - minn;
if (x1 < 0)
cout << 0 << endl;
else
cout << x1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const N = 1e6 + 6;
bool us[N], use[N];
long long a[N];
long long n, x, k, q, x1, x2, y, ibibibibbibibibiibigbabypanfewewf, y2, ans, m;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> x1;
for (int I = 0; I < x1; I++) {
cin >> n;
y = 0;
ibibibibbibibibiibigbabypanfewewf = 1e9 + 7;
for (int i = 1; i <= n; i++) {
cin >> k >> q;
y = max(y, k);
ibibibibbibibibiibigbabypanfewewf =
min(ibibibibbibibibiibigbabypanfewewf, q);
}
cout << max(0ll, y - ibibibibbibibibiibigbabypanfewewf) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, l, r;
cin >> t;
for (int j = 0; j < t; j++) {
cin >> n;
l = 0;
r = 1e9;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0, l - r) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
const long long mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long i, j, k, n, cnt = 0, x1, x2, mn = INT_MAX, mx = -1;
cin >> n;
vector<pair<long long, long long>> v;
for (long long i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort((v).begin(), (v).end());
for (long long i = 0; i < n; i++) {
mn = min(mn, v[i].second);
mx = max(mx, v[i].first);
}
cout << max(0LL, mx - mn) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream& operator<<(ostream& o, const vector<T>& v) {
int b = 0;
for (const auto& a : v) o << (b++ ? ", " : "") << a;
return o;
}
template <typename T>
ostream& operator<<(ostream& o, const set<T>& v) {
int b = 0;
for (const auto& a : v) o << (b++ ? ", " : "") << a;
return o;
}
template <typename T, typename U>
ostream& operator<<(ostream& o, const pair<T, U>& p) {
o << p.first << ' ' << p.second;
return o;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for (int _ = 0; _ < t; _++) {
int n;
cin >> n;
pair<int, int> a;
cin >> a.first >> a.second;
pair<int, pair<int, int>> curr({0, a});
for (int i = 0; i < n - 1; i++) {
pair<int, int> b;
a = curr.second;
cin >> b.first >> b.second;
if (b.first > a.second) {
curr.second.second = b.first;
if (curr.first == 0) {
curr.second.first = a.second;
}
curr.first += b.first - a.second;
} else if (b.second < a.first) {
curr.second.first = b.second;
if (curr.first == 0) {
curr.second.second = a.first;
}
curr.first += a.first - b.second;
} else if (curr.first == 0) {
if (b.second < a.second) {
curr.second.second = b.second;
}
if (b.first > a.first) {
curr.second.first = b.first;
}
}
}
cout << curr.first << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int n;
cin >> n;
vector<pair<int, int> > a;
for (int i = 0; i < n; ++i) {
int j, k;
cin >> j >> k;
a.push_back({j, 1});
a.push_back({k, 2});
}
sort(a.begin(), a.end());
int st = 0;
int l = 0, r = 0;
for (int i = 0; i < a.size(); ++i) {
if (st == 0 && a[i].second == 2) {
st = 1;
l = a[i].first;
}
if (a[i].second == 1) {
r = a[i].first;
}
}
cout << max(r - l, 0) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, m, sum, x, y;
cin >> t;
while (t--) {
cin >> n;
int mini = INT_MAX, maxi = 0;
while (n--) {
cin >> x >> y;
mini = min(mini, y);
maxi = max(maxi, x);
}
cout << max(0, maxi - mini) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
const long long limit = 1LL * 1e18;
const int MOD = 1e9 + 711;
const int MOD2 = 1e9 + 933;
const int MOD3 = 1e9 + 993;
const int mod = 1e9 + 7;
const int maxn = 5e5 + 100;
signed main() {
cout.tie(0);
cin.tie(0);
ios_base::sync_with_stdio(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int mi = -1, mx = 0;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
if (mi == -1 || y < mi) {
mi = y;
}
mx = max(mx, x);
}
cout << max(0, mx - mi) << '\n';
}
cerr << "\n\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
queue<long long> ans;
for (int i = 0; i < t; i++) {
long long n;
cin >> n;
vector<pair<long long, long long> > q;
for (int j = 0; j < n; j++) {
long long a, b;
cin >> a >> b;
q.push_back(make_pair(a, b));
}
vector<long long> a1;
vector<long long> b1;
for (int e = 0; e < n; e++) {
a1.push_back(q[e].first);
b1.push_back(q[e].second);
}
long long r_min;
long long l_max;
r_min = *min_element(b1.begin(), b1.end());
l_max = *max_element(a1.begin(), a1.end());
long long answer;
answer = l_max - r_min;
if (answer < 0) {
answer = 0;
}
ans.push(answer);
}
while (!ans.empty()) {
long long v = ans.front();
ans.pop();
cout << v << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool same(int l1, int r1, int l2, int r2) {
if (r1 < l2 || r2 < l1) {
return 0;
}
return 1;
}
signed main() {
int q;
cin >> q;
while (q--) {
int n;
cin >> n;
int l = 1e9 + 5, r = 0;
for (int i = 0; i < n; i++) {
int l3, r3;
cin >> l3 >> r3;
r = max(r, l3);
l = min(l, r3);
}
cout << max(0, r - l) << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using segment_t = std::pair<unsigned, unsigned>;
template <typename T, typename U>
std::istream& operator>>(std::istream& input, std::pair<T, U>& v) {
return input >> v.first >> v.second;
}
template <typename T>
std::istream& operator>>(std::istream& input, std::vector<T>& v) {
for (T& a : v) input >> a;
return input;
}
void answer(unsigned v) { std::cout << v << '\n'; }
void solve(std::vector<segment_t>& s) {
const size_t n = s.size();
std::sort(s.begin(), s.end());
segment_t t = {s[0].second, s[0].first};
for (size_t i = 1; i < n; ++i) {
t.first = std::min(t.first, s[i].second);
t.second = std::max(t.second, s[i].first);
}
answer(t.first < t.second ? t.second - t.first : 0);
}
void test_case() {
size_t n;
std::cin >> n;
std::vector<segment_t> s(n);
std::cin >> s;
solve(s);
}
int main() {
size_t t;
std::cin >> t;
while (t-- > 0) test_case();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
long long t;
cin >> t;
for (int j = 0; j < t; j++) {
long long n;
cin >> n;
vector<pair<long long, long long>> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i].first >> s[i].second;
}
if (n == 1) {
cout << 0 << endl;
} else {
sort(s.begin(), s.end());
long long y, k = s[n - 1].first;
y = s[n - 1].first;
for (int i = 0; i < n; i++) {
if (s[i].second < k) {
k = s[i].second;
}
}
cout << y - k << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
return x * f;
}
const int INF = 1e9;
int main() {
int T = read();
while (T--) {
int N = read(), R = INF, L = -INF;
for (int i = 1; i <= N; ++i) {
int l = read(), r = read();
R = min(R, r);
L = max(L, l);
}
printf("%d\n", R <= L ? L - R : 0);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; ++i) {
int n;
cin >> n;
long long min_r = 10e10;
long long max_l = 0;
for (int j = 0; j < n; ++j) {
long long l, r;
cin >> l >> r;
if (l > max_l) {
max_l = l;
}
if (r < min_r) {
min_r = r;
}
}
if (max_l - min_r < 0) {
cout << 0 << '\n';
} else {
cout << max_l - min_r << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
const long long inf = 1e9 + 10;
long long x[N];
int main() {
long long q;
cin >> q;
for (long long i = 1; i <= q; ++i) {
long long n;
cin >> n;
long long y = inf;
for (long long j = 1; j <= n; ++j) {
long long y1;
cin >> x[j] >> y1;
y = min(y1, y);
}
sort(x + 1, x + n + 1);
long long ans = 0;
for (long long j = n; j >= 1; --j) {
if (x[j] > y) {
ans = x[j] - y;
break;
}
}
if (ans == 0)
cout << 0 << '\n';
else
cout << ans << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 500005;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<pair<int, int>> a;
int xm = 0, ym = INT_MAX;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a.push_back(make_pair(x, y));
if (x > xm) {
xm = x;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (xm <= a[i].second) {
continue;
} else {
ans = max(ans, xm - a[i].second);
}
}
if (n == 1) {
cout << 0 << endl;
continue;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long T, n, L, R;
int main() {
cin >> T;
while (T--) {
cin >> n;
long long mx = -1, mn = 1e9 + 2;
for (long long i = 1; i <= n; ++i)
cin >> L >> R, mx = max(mx, L), mn = min(mn, R);
cout << max(mx - mn, 0LL) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, count;
vector<long long int> a1;
long long int a, b, max, min;
cin >> count;
for (long long int j = 0; j < count; j++) {
max = 0;
min = 1000000000;
cin >> n;
for (long long int i = 0; i < n; i++) {
cin >> a >> b;
if (a > max) {
max = a;
}
if (b < min) {
min = b;
}
}
a1.push_back(max - min);
}
for (long long int i = 0; i < a1.size(); i++) {
if (a1[i] > 0) {
cout << a1[i];
} else {
cout << "0";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int k = 0; k < t; ++k) {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int left = b, right = a;
for (int i = 1; i < n; ++i) {
cin >> a >> b;
if (b < left) {
left = b;
}
if (a > right) {
right = a;
}
}
if (right - left < 0) {
cout << 0 << endl;
} else
cout << right - left << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long bINF = 1e16;
const double EPS = 1e-9;
const double PI = acos(-1);
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int q;
scanf("%d", &q);
while (q--) {
int n;
scanf("%d", &n);
vector<pair<int, int>> a(n);
vector<pair<int, int>> b(n);
for (int i = 0; i < n; ++i) {
scanf("%d %d", &a[i].first, &a[i].second);
b[i] = a[i];
swap(b[i].first, b[i].second);
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
printf("%d\n", max(0, a.back().first - b[0].first));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int n;
cin >> n;
int l = 0, r = INT_MAX;
while (n--) {
int x, y;
cin >> x >> y;
l = max(x, l);
r = min(r, y);
}
cout << max(0, l - r) << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool compare_left(pair<long long int, long long int> &p,
pair<long long int, long long int> &q) {
return p.first < q.first;
}
bool compare_right(pair<long long int, long long int> &p,
pair<long long int, long long int> &q) {
return p.second < q.second;
}
int main() {
int t;
cin >> t;
int n;
vector<pair<long long int, long long int> > lines;
int i;
while (t--) {
cin >> n;
vector<pair<long long int, long long int> > lines(n);
for (i = 0; i < n; i++) {
cin >> lines[i].first >> lines[i].second;
}
long long int rightmostleftpoint =
(*max_element(lines.begin(), lines.end(), compare_left)).first;
long long int leftmostrightpoint =
(*min_element(lines.begin(), lines.end(), compare_right)).second;
long long int z = 0;
cout << max(z, (rightmostleftpoint - leftmostrightpoint)) << "\n";
lines.clear();
}
}
|
#include <bits/stdc++.h>
using namespace std;
void process(vector<pair<int, int>> &ab, int l, int r) {
for (int i = 0; i < ab.size(); i++) {
int a = ab[i].first, b = ab[i].second;
if (a <= l && l <= b || a <= r && r <= b || l <= a && a <= r ||
l <= b && b <= r) {
ab[i] = {max(l, ab[i].first), min(r, ab[i].second)};
return;
}
}
ab.push_back({l, r});
}
int main() {
int t, n, l, r;
for (cin >> t; t; t--) {
vector<pair<int, int>> ab;
for (cin >> n; n; n--) {
cin >> l >> r;
process(ab, l, r);
}
sort(ab.begin(), ab.end());
if (ab.size() == 1) {
cout << "0\n";
} else {
cout << ab.back().first - ab[0].second << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int f(string s) {
int k = 0;
for (int i = 0; i < s.size(); i++) k = 10 * k + int(s[i]) - 48;
return k;
}
int main() {
int n, k, l, m, i, j;
int x3, y3, x4, y4, a, b, x1, x2, y1, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
if (x1 + y1 >= 0)
x3 = (x1 + y1) / (2 * a);
else
x3 = (x1 + y1) / (2 * a) - 1;
if (x1 - y1 >= 0)
y3 = (x1 - y1) / (2 * b);
else
y3 = (x1 - y1) / (2 * b) - 1;
if (x2 + y2 >= 0)
x4 = (x2 + y2) / (2 * a);
else
x4 = (x2 + y2) / (2 * a) - 1;
if (x2 - y2 >= 0)
y4 = (x2 - y2) / (2 * b);
else
y4 = (x2 - y2) / (2 * b) - 1;
k = max(abs(x3 - x4), abs(y3 - y4));
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int inf = 1000000005;
long long int llinf = 2000000000000000005LL;
long long int mod = 1000000007;
long long int mod9 = 1000000009;
double pi = 3.1415926535897;
double eps = 1e-15;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1}, dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
vector<bool> isprime;
vector<int> primes;
void seive(int n, bool wantlist = true) {
isprime.resize(n + 1, true);
isprime[0] = isprime[1] = false;
int sq = sqrt(n + 1);
for (int i = 2; i < sq + 1; i++) {
if (isprime[i]) {
for (int j = i * i; j <= n; j += i) isprime[j] = false;
}
}
for (int i = 2; wantlist && i <= n; i++) {
if (isprime[i]) primes.push_back(i);
}
}
template <class T>
inline T gcd(T a, T b) {
while (b > 0) {
a %= b;
swap(a, b);
}
return a;
}
template <class T>
inline T lcm(T a, T b) {
return a * b / gcd(a, b);
}
template <class T>
inline vector<T> operator+(vector<T>& a, vector<T>& b) {
assert(a.size() == b.size());
int n = a.size();
vector<T> c(n);
for (int i = 0; i < n; i++) c[i] = a[i] + b[i];
return c;
}
int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; }
inline long long int bexp(long long int x, long long int n,
long long int m = mod) {
long long int res = 1;
x %= m;
while (n) {
if (n & 1) res = res * x % m;
x = x * x % m;
n >>= 1;
}
return res;
}
inline bool ispalin(string& str) {
int n = str.length();
for (int i = 0; i < n / 2; i++)
if (str[i] != str[n - i - 1]) return false;
return true;
}
int main() {
int a, b, x1, y1, x2, y2;
int x, y;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
x = x1;
y = y1;
x1 = x + y;
y1 = y - x;
x = x2;
y = y2;
x2 = x + y;
y2 = y - x;
a *= 2;
b *= 2;
x1 = x1 / a + (x1 > 0);
x2 = x2 / a + (x2 > 0);
y1 = y1 / b + (y1 > 0);
y2 = y2 / b + (y2 > 0);
cout << max(abs(y2 - y1), abs(x2 - x1)) << endl;
}
|
#include <bits/stdc++.h>
int main() {
long a(0), b(0), x1(0), y1(0), x2(0), y2(0);
scanf("%ld %ld %ld %ld %ld %ld", &a, &b, &x1, &y1, &x2, &y2);
long xA = x1 + y1;
long yA = x1 - y1;
long xB = x2 + y2;
long yB = x2 - y2;
long diffX = std::abs(xA / (2 * a) - xB / (2 * a) + (xA > 0) - (xB > 0));
long diffY = std::abs(yA / (2 * b) - yB / (2 * b) + (yA > 0) - (yB > 0));
long maxDiff = std::max(diffX, diffY);
printf("%ld\n", maxDiff);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int roundup(long long int x, long long int a) {
return (x < 0 ? x - x % a : x + 4 - x % a);
}
long long int rounddown(long long int x, long long int a) {
return (x < 0 ? x - 4 - x % a : x - x % a);
}
int main() {
long long int a, b, x1, y1, x2, y2, yy1, yy2, res1 = 0, res2 = 0;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a *= 2;
b *= 2;
yy1 = y1 + x1;
yy2 = y2 + x2;
if (yy1 > yy2) swap(yy1, yy2);
yy1 = roundup(yy1, a);
yy2 = rounddown(yy2, a);
if (yy1 <= yy2) res1 = (yy2 - yy1) / a + 1;
yy1 = y1 - x1;
yy2 = y2 - x2;
if (yy1 > yy2) swap(yy1, yy2);
yy1 = roundup(yy1, b);
yy2 = rounddown(yy2, b);
if (yy1 <= yy2) res2 = (yy2 - yy1) / b + 1;
cout << max(res1, res2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct pt {
long long x, y;
};
pt p1, p2, s, f;
long long a, b;
int main() {
cin >> a >> b >> p1.x >> p1.y >> p2.x >> p2.y;
s.x = p1.x + p1.y;
s.y = p1.y - p1.x;
f.x = p2.x + p2.y;
f.y = p2.y - p2.x;
s.x += 2 * a * 1000000000;
s.y += 2 * b * 1000000000;
f.x += 2 * a * 1000000000;
f.y += 2 * b * 1000000000;
f.x /= 2 * a;
s.x /= 2 * a;
f.y /= 2 * b;
s.y /= 2 * b;
cout << max(abs(f.x - s.x), abs(f.y - s.y));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, x1, x2, y2;
int x, y;
int yy1;
int main() {
cin >> a >> b >> x1 >> yy1 >> x2 >> y2;
x = x1;
y = yy1;
x1 = x + y;
yy1 = y - x;
x = x2;
y = y2;
x2 = x + y;
y2 = y - x;
a *= 2;
b *= 2;
x1 = x1 / a + (x1 > 0);
x2 = x2 / a + (x2 > 0);
yy1 = yy1 / b + (yy1 > 0);
y2 = y2 / b + (y2 > 0);
cout << max(abs(y2 - yy1), abs(x2 - x1)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.);
int main() {
long long x1, x2, y1, y2, a, b, n1, n2, k1, k2, ans = 0;
double tmp;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
tmp = 1. * (x1 + y1) / (2. * a);
n1 = (long long)tmp;
if (tmp < 0) n1--;
tmp = 1. * (x2 + y2) / (2. * a);
n2 = (long long)tmp;
if (tmp < 0) n2--;
tmp = 1. * (x1 - y1) / (2. * b);
k1 = (long long)tmp;
if (tmp < 0) k1--;
tmp = 1. * (x2 - y2) / (2. * b);
k2 = (long long)tmp;
if (tmp < 0) k2--;
if (n1 > n2)
n1 = n1 - n2;
else
n1 = n2 - n1;
if (k1 > k2)
k1 = k1 - k2;
else
k1 = k2 - k1;
if (k1 > n1)
ans = k1;
else
ans = n1;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void tran(long long &x, long long &y) {
long long x0 = x, y0 = y;
x = x0 + y0, y = x0 - y0;
}
inline long long pos(long long x, long long d) { return x / d + (x > 0); }
inline long long LLabs(long long x) { return x > 0 ? x : -x; }
int main() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
tran(x1, y1);
tran(x2, y2);
cout << max(LLabs(pos(x2, a * 2) - pos(x1, a * 2)),
LLabs(pos(y2, b * 2) - pos(y1, b * 2)))
<< endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool solve(int& tc) {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
int lr = (x1 + y1) / (2 * a) + (x1 + y1 < 0 ? -1 : 0);
int lc = (x1 - y1) / (2 * b) + (x1 - y1 < 0 ? -1 : 0);
int rr = (x2 + y2) / (2 * a) + (x2 + y2 < 0 ? -1 : 0);
int rc = (x2 - y2) / (2 * b) + (x2 - y2 < 0 ? -1 : 0);
cout << max(abs(rr - lr), abs(rc - lc)) << endl;
return false;
}
int main() {
int n = 1 << 30;
if (!n) cin >> n;
for (int i = 0; i < n && solve(i); ++i)
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mdiv(long long int a, long long int b) {
if ((a > 0) && (b > 0)) {
return a / b;
} else {
return a / b - 1;
}
}
long long int mmod(long long int a) {
if (a > 0)
return a;
else
return -a;
}
long long int mmax(long long int a, long long int b) { return a > b ? a : b; }
int main() {
long long int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long int hmin1 = mdiv(x1 + y1, 2 * a) + 1;
long long int hmax1 = mdiv(x2 + y2, 2 * a) + 1;
long long int hordiff = mmod(hmax1 - hmin1);
long long int hmin2 = mdiv(y1 - x1, 2 * b) + 1;
long long int hmax2 = mdiv(y2 - x2, 2 * b) + 1;
long long int verdiff = mmod(hmax2 - hmin2);
cout << mmax(verdiff, hordiff) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, x1, y1, x2, y2, k1, k2, k11, k12, k21, k22, a1, b1, a2, b2;
while (scanf("%I64d%I64d%I64d%I64d%I64d%I64d", &a, &b, &x1, &y1, &x2, &y2) !=
EOF) {
a1 = x1 + y1;
b1 = x1 - y1;
k11 = a1 / (2 * a);
if (a1 < 0) k11--;
k12 = b1 / (2 * b);
if (b1 < 0) k12--;
a2 = x2 + y2;
b2 = x2 - y2;
k21 = a2 / (2 * a);
if (a2 < 0) k21--;
k22 = b2 / (2 * b);
if (b2 < 0) k22--;
k1 = abs(k11 - k21);
k2 = abs(k12 - k22);
printf("%I64d\n", max(k1, k2));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans, x1, y3, x2, y2, a, b;
int cal(int a, int b) { return (int)floor((double)a / b); }
int main() {
scanf("%I64d%I64d%I64d%I64d%I64d%I64d", &a, &b, &x1, &y3, &x2, &y2);
a = a * 2;
b = b * 2;
ans = max(abs(cal(x1 + y3, a) - cal(x2 + y2, a)),
abs(cal(x1 - y3, b) - cal(x2 - y2, b)));
printf("%I64d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
if (a >= b)
return a;
else
return b;
}
long long int min(long long int a, long long int b) {
if (a <= b)
return a;
else
return b;
}
long long int kabs(long long int a) {
if (a >= 0)
return a;
else
return -a;
}
long long int num(vector<long long int> mono, vector<long long int> jun,
long long int n) {
long long int tmp = 0;
for (long long int i = 0; i < ((long long int)(n)); i++) {
tmp = tmp * 10 + mono[jun[i]];
}
return tmp;
}
int main() {
long long int a, b, x1, y1, x2, y2;
long long int wa1, wa2, sa1, sa2;
long long int mod1, mod2, m1, m2, res = 0;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
wa1 = x1 + y1;
wa2 = x2 + y2;
sa1 = x1 - y1;
sa2 = x2 - y2;
mod1 = wa1 / (a * 2);
mod2 = wa2 / (a * 2);
if (wa1 < 0) mod1--;
if (wa2 < 0) mod2--;
res += kabs(mod1 - mod2);
m1 = sa1 / (b * 2);
m2 = sa2 / (b * 2);
if (sa1 < 0) m1--;
if (sa2 < 0) m2--;
res += kabs(m1 - m2);
if (wa1 % (a * 2) == 0 || sa1 % (b * 2) == 0) res++;
if (wa2 % (a * 2) == 0 || sa2 % (b * 2) == 0) res++;
res -= min(kabs(m1 - m2), kabs(mod1 - mod2));
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long X1, X2, Y1, Y2, A, B;
long long Res;
int main() {
cin >> A >> B >> X1 >> Y1 >> X2 >> Y2;
A *= 2;
B *= 2;
Res = 0;
long long UpB, LowB;
long long MinX = min(X1 + Y1, X2 + Y2);
long long MaxX = max(X1 + Y1, X2 + Y2);
LowB = ceil(double(MinX) / A);
UpB = floor(double(MaxX) / A);
if (UpB >= LowB) {
Res = max(Res, UpB - LowB + 1);
}
long long MinY = min(X1 - Y1, X2 - Y2);
long long MaxY = max(X1 - Y1, X2 - Y2);
LowB = ceil(double(MinY) / B);
UpB = floor(double(MaxY) / B);
if (UpB >= LowB) {
Res = max(Res, UpB - LowB + 1);
}
cout << Res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x0, y0, x1, y1;
scanf("%d%d%d%d%d%d", &a, &b, &x0, &y0, &x1, &y1);
int ac = (int)floor((double)(y0 - x0) / (2 * b));
ac -= (int)floor((double)(y1 - x1) / (2 * b));
ac = abs(ac);
int ab = (int)floor((double)(y0 + x0) / (2 * a));
ab -= (int)floor((double)(y1 + x1) / (2 * a));
ab = abs(ab);
printf("%d\n", max(ab, ac));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int abc(int a) { return a < 0 ? -a : a; }
int main(void) {
int a, b, x1, y1, x2, y2;
scanf("%d%d%d%d%d%d", &a, &b, &x1, &y1, &x2, &y2);
int px1 = (x1 + y1) / (2 * a), py1 = (x1 - y1) / (2 * b);
int px2 = (x2 + y2) / (2 * a), py2 = (x2 - y2) / (2 * b);
if (x1 + y1 > 0)
px1++;
else
px1--;
if (x1 - y1 > 0)
py1++;
else
py1--;
if (x2 + y2 > 0)
px2++;
else
px2--;
if (x2 - y2 > 0)
py2++;
else
py2--;
int d1 = abc(px1 - px2);
if ((px1 > 0 && px2 < 0) || (px1 < 0 && px2 > 0)) d1--;
int d2 = abc(py1 - py2);
if ((py1 > 0 && py2 < 0) || (py1 < 0 && py2 > 0)) d2--;
printf("%d\n", max(d1, d2));
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(const T &a) {
return a * a;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long ans1 = 0, ans2 = 0;
long long a, b, x1, aasdfasdfasdf, x2, y2;
cin >> a >> b >> x1 >> aasdfasdfasdf >> x2 >> y2;
{
long long dist = x1 + aasdfasdfasdf - (x2 + y2);
long long x = dist > 0 ? x1 + aasdfasdfasdf - dist : x1 + aasdfasdfasdf;
cerr << dist << " " << x << endl;
dist = abs(dist);
x += 4 * a + abs(x / (2 * a)) * 2 * a;
assert(x >= 0);
cerr << dist << " " << x << endl;
ans1 = dist / (2 * a);
if (x / (2 * a) != (x + dist % (2 * a)) / (2 * a)) ans1++;
}
{
long long dist = x1 - aasdfasdfasdf - (x2 - y2);
long long x = dist > 0 ? x1 - aasdfasdfasdf - dist : x1 - aasdfasdfasdf;
dist = abs(dist);
x += 4 * b + abs(x / (2 * b)) * 2 * b;
assert(x >= 0);
cerr << dist << " " << x << endl;
ans2 += dist / (2 * b);
if (x / (2 * b) != (x + dist % (2 * b)) / (2 * b)) ans2++;
}
printf("%lld\n", min(ans1, ans2) + max(ans2, ans1) - min(ans2, ans1));
}
|
#include <bits/stdc++.h>
using namespace std;
int vert, oriz;
int xf, yf, xs, ys;
int dif_vert(int a, int b);
int dif_oriz(int a, int b);
int main() {
int xf, xs, yf, ys;
cin >> oriz >> vert >> xf >> yf >> xs >> ys;
oriz *= 2;
vert *= 2;
int r = max(dif_vert(ys - xs, yf - xf), dif_oriz(xf + yf, xs + ys));
cout << r;
return 0;
}
int dif_oriz(int a, int b) {
if (a <= 0 && b <= 0) a *= -1, b *= -1;
if (a < b) swap(a, b);
if (a == b) return 0;
if (b == 0) return a / oriz + 1;
if (b > 0) return a / oriz - (b - 1) / oriz;
if (b < 0) return a / oriz + 1 - b / oriz;
}
int dif_vert(int a, int b) {
if (a <= 0 && b <= 0) a *= -1, b *= -1;
if (a < b) swap(a, b);
if (a == b) return 0;
if (b == 0) return a / vert + 1;
if (b > 0) return a / vert - (b - 1) / vert;
if (b < 0) return a / vert + 1 - b / vert;
}
|
#include <bits/stdc++.h>
using namespace std;
int bs(int x) {
if (x < 0) return -x;
return x;
}
int main() {
long long a, b, x1, y1, x2, y2, k1, k2, sp1, sp2, sm1, sm2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a *= 2, b *= 2;
sp1 = x1 + y1, sp2 = x2 + y2, sm1 = y1 - x1, sm2 = y2 - x2;
if (sp1 > sp2) swap(sp1, sp2);
if (sm1 > sm2) swap(sm1, sm2);
k1 = (sp2 - 1) / a - sp1 / a, k2 = (sm2 - 1) / b - sm1 / b;
if (sp1 * sp2 < 0) k1++;
if (sm1 * sm2 < 0) k2++;
cout << max(k1, k2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = acos(-1.);
template <class T>
inline T sq(T x) {
return x * x;
}
template <class T>
inline void upd_min(T &lhs, T rhs) {
if (lhs > rhs) lhs = rhs;
}
template <class T>
inline void upd_max(T &lhs, T rhs) {
if (lhs < rhs) lhs = rhs;
}
void solve() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long p = x1 + y1;
long long q = x2 + y2;
long long r = x1 - y1;
long long s = x2 - y2;
long long _p = p - (((p) % (2 * a) + (2 * a)) % (2 * a));
long long _q = q - (((q) % (2 * a) + (2 * a)) % (2 * a));
long long _r = r - (((r) % (2 * b) + (2 * b)) % (2 * b));
long long _s = s - (((s) % (2 * b) + (2 * b)) % (2 * b));
long long cand1 = abs(_p - _q) / (2 * a);
long long cand2 = abs(_r - _s) / (2 * b);
cout << max(cand1, cand2) << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
int a, b, x1, ___y1, x2, y2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> a >> b >> x1 >> ___y1 >> x2 >> y2;
int x = x1, y = ___y1;
x1 = x + y;
___y1 = x - y;
x = x2, y = y2;
x2 = x + y;
y2 = x - y;
a <<= 1;
b <<= 1;
x1 = x1 / a + (x1 > 0);
x2 = x2 / a + (x2 > 0);
___y1 = ___y1 / b + (___y1 > 0);
y2 = y2 / b + (y2 > 0);
cout << max(abs(x1 - x2), abs(___y1 - y2));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const long long LINF = (1ll << 62) - 1;
const int DIRX[] = {-1, 0, 0, 1, -1, -1, 1, 1},
DIRY[] = {0, -1, 1, 0, -1, 1, -1, 1};
const double ERR = 1e-11, PI = (2 * acos(0.0));
template <class T>
inline T MIN(T a, T b) {
return ((a < b) ? (a) : (b));
}
template <class T>
inline T MAX(T a, T b) {
return ((b < a) ? (a) : (b));
}
template <class T>
inline T ABS(T a) {
return ((a < (T)0) ? (-a) : (a));
}
template <class T>
inline void checkMIN(T& a, T b) {
if (b < a) a = b;
}
template <class T>
inline void checkMAX(T& a, T b) {
if (a < b) a = b;
}
template <class T>
inline T SQR(T x) {
return (x * x);
}
template <class T>
T GCD(T a, T b) {
if (!b)
return a;
else
return GCD(b, a % b);
}
template <class T>
T fastPow(T Base, T Power) {
T Result = (T)1;
while (Power > 0) {
if (Power & (T)1) Result *= Base;
Power >>= 1;
Base *= Base;
}
return Result;
}
template <class T>
T fastModPow(T Base, T Power, T Mod) {
T Result = (T)1;
while (Power > 0) {
if (Power & (T)1) Result = (Result * Base) % Mod;
Power >>= 1;
Base = (Base * Base) % Mod;
}
return (Result % Mod);
}
inline int CompareDouble(double x, double y, double err = ERR) {
double d = x - y;
if (d > err)
return 1;
else if (d < -err)
return -1;
else
return 0;
}
int main() {
int _kase = 1;
long long i, j, k, n, a, b, x1, x2, y1, y2;
long long aa, a1, a2, ra, bb, b1, b2, rb;
long long mn, mx, div, rem;
while (_kase--) {
cin >> aa >> bb >> x1 >> y1 >> x2 >> y2;
aa *= 2;
bb *= 2;
a1 = x1 + y1;
a2 = x2 + y2;
mn = MIN(a1, a2);
mx = MAX(a1, a2);
if (mn % aa == 0)
div = mn / aa;
else {
div = mn / aa;
if (mn < 0) div--;
}
rem = mn - (div * aa);
if (rem) mn += aa - rem;
if (mx % aa == 0)
div = mx / aa;
else {
div = mx / aa;
if (mx < 0) div--;
}
rem = mx - (div * aa);
mx -= rem;
if (mx < mn)
ra = 0;
else
ra = 1 + (mx - mn) / aa;
b1 = x1 - y1;
b2 = x2 - y2;
mn = MIN(b1, b2);
mx = MAX(b1, b2);
if (mn % bb == 0)
div = mn / bb;
else {
div = mn / bb;
if (mn < 0) div--;
}
rem = mn - (div * bb);
if (rem) mn += bb - rem;
if (mx % bb == 0)
div = mx / bb;
else {
div = mx / bb;
if (mx < 0) div--;
}
rem = mx - (div * bb);
mx -= rem;
if (mx < mn)
rb = 0;
else
rb = 1 + (mx - mn) / bb;
cout << MAX(ra, rb) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, xx, yy, a, b, k1, k2, kk1, kk2;
scanf("%d%d %d%d %d%d", &a, &b, &x, &y, &xx, &yy);
k1 = (x + y) / (2 * a);
if (x + y < 0) k1--;
k2 = (x - y) / (2 * b);
if (x - y < 0) k2--;
kk1 = (xx + yy) / (2 * a);
if (xx + yy < 0) kk1--;
kk2 = (xx - yy) / (2 * b);
if (xx - yy < 0) kk2--;
printf("%d\n", max(abs(k1 - kk1), abs(k2 - kk2)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
int ac = (int)floor((double)(y1 - x1) / (2 * b));
ac -= (int)floor((double)(y2 - x2) / (2 * b));
ac = abs(ac);
int ab = (int)floor((double)(y1 + x1) / (2 * a));
ab -= (int)floor((double)(y2 + x2) / (2 * a));
ab = abs(ab);
cout << max(ac, ab);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x1, y1, x2, y2, ans = 0;
scanf("%d%d%d%d%d%d", &a, &b, &x1, &y1, &x2, &y2);
int k1 = y2 - x2;
int k2 = y1 - x1;
int m1 = ceil(k1 / (2.0 * b));
int m2 = ceil(k2 / (2.0 * b));
ans += abs(m1 - m2);
k1 = y2 + x2;
k2 = y1 + x1;
m1 = ceil(k1 / (2.0 * a));
m2 = ceil(k2 / (2.0 * a));
printf("%d\n", max(ans, abs(m2 - m1)));
}
|
#include <bits/stdc++.h>
using namespace std;
int standardized(int &x, int a);
int handle(int a, int b, int x1, int x2, int y1, int y2);
int main() {
int a, b;
int x1, y1;
int x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
int res = handle(a, b, x1, x2, y1, y2);
cout << res;
return 0;
}
int standardized(int &x, int a) { return x = x / a + (x > 0); }
int handle(int a, int b, int x1, int x2, int y1, int y2) {
int x, y;
a *= 2;
b *= 2;
x = x1;
y = y1;
x1 = x + y;
y1 = y - x;
x = x2;
y = y2;
x2 = x + y;
y2 = y - x;
x1 = standardized(x1, a);
x2 = standardized(x2, a);
y1 = standardized(y1, b);
y2 = standardized(y2, b);
return max(abs(y2 - y1), abs(x2 - x1));
}
|
#include <bits/stdc++.h>
using namespace std;
int count(int x, int y) {
if (x < 0)
return -((-x) / y) - 1;
else
return x / y;
}
int main() {
int x, y, xx, yy, a, b;
cin >> a >> b >> x >> y >> xx >> yy;
a *= 2;
b *= 2;
int ax, ay, bx, by;
ax = count(x + y, a);
bx = count(xx + yy, a);
ay = count(x - y, b);
by = count(xx - yy, b);
printf("%d\n", max(abs(ax - bx), abs(ay - by)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long cal(long long l, long long r, long long x) {
long long t, c, d1, d2;
if (l > r) {
t = l;
l = r;
r = t;
}
d1 = (r - l) / x;
d2 = (r - l) % x;
c = l % x;
if (c < 0) c += x;
if (d2 > x - c) ++d1;
return d1;
}
int main() {
long long a, b, x1, y1, x2, y2, s1, s2;
scanf("%I64d %I64d %I64d %I64d %I64d %I64d", &a, &b, &x1, &y1, &x2, &y2);
s1 = cal(x1 + y1, x2 + y2, 2 * a);
s2 = cal(x1 - y1, x2 - y2, 2 * b);
if (s1 < s2)
printf("%I64d\n", s2);
else
printf("%I64d\n", s1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long tmp = x1;
x1 = tmp + y1;
y1 = tmp - y1;
tmp = x2;
x2 = tmp + y2;
y2 = tmp - y2;
long long xn1 = x1 + 2ll * a - (x1 % (2ll * a) + 2ll * a) % (2ll * a) - 1,
yn1 = y1 + 2ll * b - (y1 % (2ll * b) + 2ll * b) % (2ll * b) - 1;
long long xn2 = x2 + 2ll * a - (x2 % (2ll * a) + 2ll * a) % (2ll * a) - 1,
yn2 = y2 + 2ll * b - (y2 % (2ll * b) + 2ll * b) % (2ll * b) - 1;
if (xn1 > xn2) swap(xn1, xn2);
if (yn1 > yn2) swap(yn1, yn2);
long long ans = max((xn2 - xn1) / (2ll * a), (yn2 - yn1) / (2ll * b));
cout << ans;
cin >> x1;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793238462643l;
void solve();
int main() {
solve();
return 0;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void solve() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long ans1, ans2;
long long eps11 = 0, eps12 = 0, eps21 = 0, eps22 = 0;
if (x1 + y1 < 0) eps11 = -2 * a;
if (x2 + y2 < 0) eps12 = -2 * a;
if (x1 - y1 < 0) eps21 = -2 * b;
if (x2 - y2 < 0) eps22 = -2 * b;
ans1 = (x1 + y1 + eps11) / (2 * a) - (eps12 + x2 + y2) / (2 * a);
ans2 = (eps21 + x1 - y1) / (2 * b) - (eps22 + x2 - y2) / (2 * b);
if (ans1 < 0) ans1 = -ans1;
if (ans2 < 0) ans2 = -ans2;
cout << max(ans1, ans2);
}
|
#include <bits/stdc++.h>
using namespace std;
int x1, y1_, x2, y2, a, b;
int otrizplusplus(int a, int b) { return (a >= 0) ? a / b : (-1 + a / b); }
int main() {
cin >> a >> b >> x1 >> y1_ >> x2 >> y2;
a *= 2;
b *= 2;
int res1, res2;
res1 = abs(otrizplusplus(x1 + y1_, a) - otrizplusplus(x2 + y2, a));
res2 = abs(otrizplusplus(x1 - y1_, b) - otrizplusplus(x2 - y2, b));
cout << max(res1, res2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int findFloor(int v, int unit) {
if (v < 0) return v / unit;
return v / unit + 1;
}
int main() {
int A, B, x1, y1, x2, y2, ans1, ans2;
scanf("%d%d%d%d%d%d", &A, &B, &x1, &y1, &x2, &y2);
ans1 = abs(findFloor(x1 + y1, 2 * A) - findFloor(x2 + y2, 2 * A));
ans2 = abs(findFloor(x1 - y1, 2 * B) - findFloor(x2 - y2, 2 * B));
printf("%d\n", max(ans1, ans2));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a1, b1, a2, b2, a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a1 = (x1 + y1) / (2 * a) + (x1 + y1 > 0);
b1 = (x1 - y1) / (2 * b) + (x1 - y1 > 0);
a2 = (x2 + y2) / (2 * a) + (x2 + y2 > 0);
b2 = (x2 - y2) / (2 * b) + (x2 - y2 > 0);
cout << max(abs(a1 - a2), abs(b1 - b2)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x1, y1, x2, y2;
while (cin >> a >> b >> x1 >> y1 >> x2 >> y2) {
tie(x1, y1) = make_pair(x1 + y1, y1 - x1);
tie(x2, y2) = make_pair(x2 + y2, y2 - x2);
a *= 2;
b *= 2;
x1 = x1 / a + (x1 > 0);
y1 = y1 / b + (y1 > 0);
x2 = x2 / a + (x2 > 0);
y2 = y2 / b + (y2 > 0);
cout << max(abs(y2 - y1), abs(x2 - x1)) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int a, b, x[2], y[2], xx[2], yy[2];
int abs(int t) { return t < 0 ? -t : t; }
int fndX(int q) {
int l = -INF, r = INF;
while (r - l > 1) {
int m = (l + r) / 2;
if (m * 2ll * a < x[q] + y[q])
l = m;
else
r = m;
}
return l;
}
int fndY(int q) {
int l = -INF, r = INF;
while (r - l > 1) {
int m = (l + r) / 2;
if (m * 2ll * b < x[q] - y[q])
l = m;
else
r = m;
}
return l;
}
int main() {
cin >> a >> b >> x[0] >> y[0] >> x[1] >> y[1];
xx[0] = fndX(0), yy[0] = fndY(0);
xx[1] = fndX(1), yy[1] = fndY(1);
cout << max(abs(xx[1] - xx[0]), abs(yy[1] - yy[0])) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, x1, x2, y11, y2;
int f(int x, int c) {
if (x >= 1)
return (x - 1) / c;
else
return x / c - 1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> a >> b >> x1 >> y11 >> x2 >> y2;
x1 = x1 + y11;
y11 = x1 - 2 * y11;
x2 = x2 + y2;
y2 = x2 - 2 * y2;
cout << max(abs(f(x1, 2 * a) - f(x2, 2 * a)),
abs(f(y11, 2 * b) - f(y2, 2 * b)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int g[100][100];
int ceil(int a, int b) {
if (a >= 0) return a / b;
if (a % b == 0)
return a / b;
else
return a / b - 1;
}
void oku() {
int n, a, b, x1, y1, x2, y2;
memset(g, 0, sizeof g);
n = 30;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a *= 2;
b *= 2;
int x, y;
int t1 = ceil(x1 + y1, a);
int t2 = ceil(x1 - y1, b);
int t3 = ceil(x2 + y2, a);
int t4 = ceil(x2 - y2, b);
cout << max(abs(t1 - t3), abs(t2 - t4));
}
int main() {
oku();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a *= 2, b *= 2;
int i =
abs((x2 + y2) / a - (x1 + y1) / a) + (1LL * (x1 + y1) * (x2 + y2) < 0);
int j =
abs((x2 - y2) / b - (x1 - y1) / b) + (1LL * (x1 - y1) * (x2 - y2) < 0);
cout << max(i, j) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}
const ll MODBASE = 1000000007LL;
const int MAXN = 100010;
const int MAXM = 200010;
const int MAXK = 110;
const int MAXQ = 200010;
ll a, b, A, B;
pair<ll, ll> st, fi;
pair<ll, ll> transform(pair<ll, ll> p) {
return pair<ll, ll>(p.first + p.second, p.first - p.second);
}
pair<ll, ll> findBlock(pair<ll, ll> p) {
pair<ll, ll> res;
if (p.first >= 0)
res.first = p.first / A;
else
res.first = p.first / A - (p.first % A != 0);
if (p.second >= 0)
res.second = p.second / B;
else
res.second = p.second / B - (p.second % B != 0);
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
cin >> a >> b >> st.first >> st.second >> fi.first >> fi.second;
A = a * 2;
B = b * 2;
st = transform(st);
fi = transform(fi);
pair<ll, ll> g = findBlock(st), h = findBlock(fi);
cout << max(abs(g.first - h.first), abs(g.second - h.second));
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long a, b, x1, y1, x2, y2, t;
scanf("%I64d%I64d%I64d%I64d%I64d%I64d", &a, &b, &x1, &y1, &x2, &y2);
t = x1;
x1 = x1 + y1;
y1 = y1 - t;
t = x2;
x2 = x2 + y2;
y2 = y2 - t;
if (x1 > x2) {
long long q;
q = x1;
x1 = x2;
x2 = q;
}
if (y1 > y2) {
long long q;
q = y1;
y1 = y2;
y2 = q;
}
printf(
"%I64d",
((((((x1) < 0) ? (((x2) + ((((((x1) / (2 * a)) < 0) ? (-((x1) / (2 * a)))
: ((x1) / (2 * a)))) +
1) *
(2 * a)) /
(2 * a))
: (((x2) - (((((x1) / (2 * a)) < 0) ? (-((x1) / (2 * a)))
: ((x1) / (2 * a))) *
(2 * a))) /
(2 * a)))) >
((((y1) < 0) ? (((y2) + ((((((y1) / (2 * b)) < 0) ? (-((y1) / (2 * b)))
: ((y1) / (2 * b)))) +
1) *
(2 * b)) /
(2 * b))
: (((y2) - (((((y1) / (2 * b)) < 0) ? (-((y1) / (2 * b)))
: ((y1) / (2 * b))) *
(2 * b))) /
(2 * b)))))
? ((((x1) < 0)
? (((x2) + ((((((x1) / (2 * a)) < 0) ? (-((x1) / (2 * a)))
: ((x1) / (2 * a)))) +
1) *
(2 * a)) /
(2 * a))
: (((x2) - (((((x1) / (2 * a)) < 0) ? (-((x1) / (2 * a)))
: ((x1) / (2 * a))) *
(2 * a))) /
(2 * a))))
: ((((y1) < 0)
? (((y2) + ((((((y1) / (2 * b)) < 0) ? (-((y1) / (2 * b)))
: ((y1) / (2 * b)))) +
1) *
(2 * b)) /
(2 * b))
: (((y2) - (((((y1) / (2 * b)) < 0) ? (-((y1) / (2 * b)))
: ((y1) / (2 * b))) *
(2 * b))) /
(2 * b))))));
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a, b, x1, y, x2, y2;
int main() {
cin >> a >> b >> x1 >> y >> x2 >> y2;
long long int da;
long long int k1 = x1 + y;
long long int k2 = x2 + y2;
long long int mi = min(k1, k2);
long long int ma = max(k1, k2);
long long int c = mi % (2 * a);
if (c < 0) c += 2 * a;
if (c != 0) mi += 2 * a - c;
c = ma % (2 * a);
if (c < 0) c += 2 * a;
ma -= c;
if (mi > ma)
da = 0;
else
da = (ma - mi) / (2 * a) + 1;
long long int db;
long long int t1 = x1 - y;
long long int t2 = x2 - y2;
mi = min(t1, t2);
ma = max(t1, t2);
c = mi % (2 * b);
if (c < 0) c += 2 * b;
if (c != 0) mi += 2 * b - c;
c = ma % (2 * b);
if (c < 0) c += 2 * b;
ma -= c;
if (mi > ma)
db = 0;
else
db = (ma - mi) / (2 * b) + 1;
cout << max(da, db);
}
|
#include <bits/stdc++.h>
using namespace std;
long long aabs(long long a) {
if (a < 0)
return -a;
else
return a;
}
long long a, b, x1, x2, aasdfasdfasdf, y2, s1, s2, ans;
int main() {
cin >> a >> b;
cin >> x1 >> aasdfasdfasdf >> x2 >> y2;
s1 = (x1 + aasdfasdfasdf + 2000000000ll * 2 * a) / (2 * a);
s2 = (y2 + x2 + 2000000000ll * 2 * a) / (2 * a);
ans = aabs(s1 - s2);
s1 = (x1 - aasdfasdfasdf + 2000000000ll * 2 * b) / (2 * b);
s2 = (x2 - y2 + 2000000000ll * 2 * b) / (2 * b);
ans = max(ans, aabs(s1 - s2));
cout << ans << endl;
cin.get();
cin.get();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int inf = 1000000009;
int findB(int x, int y, int a) {
long long low = -inf;
long long high = inf;
long long val, mid;
while (low < high) {
mid = low + (high - low) / 2;
val = x - y - 2 * a * mid;
if (val < 0) {
high = mid;
} else
low = mid + 1;
}
return low;
}
int findA(int x, int y, int a) {
long long low = -inf;
long long high = inf;
long long val, mid;
while (low < high) {
mid = low + (high - low) / 2;
val = x + y - 2 * a * mid;
if (val < 0) {
high = mid;
} else
low = mid + 1;
}
return low;
}
int main() {
int a, b, x1, y1, x2, y2;
int a1, a2, b1, b2, ret;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a1 = findA(x1, y1, a);
a2 = findA(x2, y2, a);
b1 = findB(x1, y1, b);
b2 = findB(x2, y2, b);
ret = max(abs(a1 - a2), abs(b1 - b2));
cout << ret;
return 0;
}
|
#include <bits/stdc++.h>
long long maximum(long long a, long long b) {
if (a > b) {
return a;
} else {
return b;
}
}
int main() {
long long a, b, x1, y1, x2, y2, p, q, r, s;
scanf("%I64d %I64d %I64d %I64d %I64d %I64d", &a, &b, &x1, &y1, &x2, &y2);
a *= 2;
b *= 2;
p = (x1 + y1) / a;
q = (x2 + y2) / a;
if (x1 + y1 < 0) p--;
if (x2 + y2 < 0) q--;
r = (x1 - y1) / b;
s = (x2 - y2) / b;
if (x1 - y1 < 0) r--;
if (x2 - y2 < 0) s--;
printf("%I64d\n", maximum(abs(p - q), abs(r - s)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
while (b ^= a ^= b ^= a %= b)
;
return a;
}
const int maxn = 1e5 + 9;
const int mod = 1e7 + 9;
int main() {
int a, b, x1, x2, y1, y2;
int x, y;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
x = x1;
y = y1;
x1 = x + y;
y1 = y - x;
x = x2;
y = y2;
x2 = x + y;
y2 = y - x;
a *= 2;
b *= 2;
x1 = x1 / a + (x1 > 0);
x2 = x2 / a + (x2 > 0);
y1 = y1 / b + (y1 > 0);
y2 = y2 / b + (y2 > 0);
cout << max(abs(y2 - y1), abs(x2 - x1)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A, B, X1, Y1, X2, Y2;
int input() {
cin >> A >> B >> X1 >> Y1 >> X2 >> Y2;
return 0;
}
int solve() {
int t1, t2, t3;
t1 = abs(((X1 + Y1) / (2 * A)) - ((X2 + Y2) / (2 * A)));
t2 = abs(((X1 - Y1) / (2 * B)) - ((X2 - Y2) / (2 * B)));
if (((X1 - Y1) >= 0 && (X2 - Y2) <= 0) || ((X1 - Y1) <= 0 && (X2 - Y2) >= 0))
t2++;
if (((X1 + Y1) >= 0 && (X2 + Y2) <= 0) || ((X1 + Y1) <= 0 && (X2 + Y2) >= 0))
t1++;
return max(t1, t2);
}
int main() {
input();
cout << solve() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Upper(int x, int y) {
int ret = x / y;
while ((long long)ret * y <= x) ret++;
while ((long long)(ret - 1) * y > x) ret--;
return ret;
}
int Lower(int x, int y) {
int ret = x / y;
while ((long long)ret * y >= x) ret--;
while ((long long)(ret + 1) * y < x) ret++;
return ret;
}
int main() {
int a, b, x1, y1, x2, y2;
scanf("%d%d%d%d%d%d", &a, &b, &x1, &y1, &x2, &y2);
if (x1 == x2 && y1 == y2) {
puts("1");
return 0;
}
x1 = x1 - y1;
y1 = x1 + y1 + y1;
x2 = x2 - y2;
y2 = x2 + y2 + y2;
if (x1 > x2) {
swap(x1, x2);
swap(y1, y2);
}
if (y1 > y2) {
y1 = -y1;
y2 = -y2;
}
int s1 = 0, s2 = 0, k1 = Upper(y1, 2 * a), k2 = Lower(y2, 2 * a);
if (k1 <= k2) {
s1 = k2 - k1 + 1;
y2 -= 2 * a * (k2 - k1 + 1);
}
k1 = Upper(x1, 2 * b), k2 = Lower(x2, 2 * b);
if (k1 <= k2) {
s2 = k2 - k1 + 1;
x2 -= 2 * b * (k2 - k1 + 1);
}
int res = max(s1, s2);
if (abs(x1) % (2 * b) == 0 || abs(y1) % (2 * a) == 0) res++;
if (abs(x2) % (2 * b) == 0 || abs(y2) % (2 * a) == 0) res++;
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a <<= 1;
b <<= 1;
int r1 = (x1 + y1) / a, r2 = (x2 + y2) / a, r3 = (x1 - y1) / b,
r4 = (x2 - y2) / b;
if (x1 + y1 < 0) r1 -= 1;
if (x2 + y2 < 0) r2 -= 1;
if (x1 - y1 < 0) r3 -= 1;
if (x2 - y2 < 0) r4 -= 1;
r1 = abs(r1 - r2);
r3 = abs(r3 - r4);
int res = min(r1, r3) + abs(r3 - r1);
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void ga(int N, int *A) {
for (int i(0); i < N; i++) scanf("%d", A + i);
}
long long a, b, x, y, X, Y;
int main(void) {
scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &x, &y, &X, &Y);
printf("%lld\n", max(abs((x + y) / (2 * a) + (x + y > 0) - (X + Y) / (2 * a) -
(X + Y > 0)),
abs((x - y) / (2 * b) + (x - y > 0) - (X - Y) / (2 * b) -
(X - Y > 0))));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long LINF = ~(((long long)0x1) << 63) / 2;
const int INF = 0X3F3F3F3F;
const double eps = 1e-7;
int main() {
long long a, b, x1, y1, x2, y2;
long long ans = 0;
long long mina, minb, maxa, maxb;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a *= 2;
b *= 2;
mina = x1 + y1;
maxa = x2 + y2;
minb = x1 - y1;
maxb = x2 - y2;
int xa, ya, xb, yb;
xa = abs(mina / a - maxa / a);
if (mina * maxa <= 0) xa++;
xb = abs(minb / b - maxb / b);
if (minb * maxb <= 0) xb++;
cout << max(xa, xb) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Max(long long a, long long b) {
if (a > b) return a;
return b;
}
long long Min(long long a, long long b) {
if (a < b) return a;
return b;
}
long long myfloor(long long a, long long b) {
if (a % b == 0) return a / b;
return a > 0 ? a / b : a / b - 1LL;
}
int main() {
long long a, b, x1, x2, y1, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long s1 = x1 + y1, s2 = x2 + y2;
long long mmin = Min(s1, s2);
long long mmax = Max(s1, s2);
long long ans1 = myfloor(mmax, (2 * a)) - myfloor((mmin), (2 * a));
s1 = x1 - y1, s2 = x2 - y2;
mmin = Min(s1, s2);
mmax = Max(s1, s2);
long long ans2 = myfloor(mmax, (2 * b)) - myfloor((mmin), (2 * b));
long long ans = Max(ans1, ans2);
cout << Max(ans, 0LL) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
int k1 = (x1 + y1) / (2 * a) + (x1 + y1 < 0 ? -1 : 0);
int k2 = (x1 - y1) / (2 * b) + (x1 - y1 < 0 ? -1 : 0);
int k3 = (x2 + y2) / (2 * a) + (x2 + y2 < 0 ? -1 : 0);
int k4 = (x2 - y2) / (2 * b) + (x2 - y2 < 0 ? -1 : 0);
int ans = max(abs(k1 - k3), abs(k2 - k4));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int ans, sum, tmp;
int MAX, MIN;
int main() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long dx, dy;
dx = abs((x1 + y1) / (2 * a) - (x2 + y2) / (2 * a));
if ((x1 + y1) * (x2 + y2) < 0) dx++;
dy = abs((x1 - y1) / (2 * b) - (x2 - y2) / (2 * b));
if ((x1 - y1) * (x2 - y2) < 0) dy++;
cout << max(dx, dy);
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, b;
long long cross(long long xx1, long long xx2, long long aa) {
if (xx1 * xx2 <= 0)
return abs(xx1) / aa + abs(xx2) / aa + 1;
else
return abs((xx1) / aa - (xx2) / aa);
}
int main() {
long long x1, y1, x2, y2, xx1, xx2, yy1, yy2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long res = 0;
res = cross(x1 + y1, x2 + y2, 2 * a);
res = max(res, cross(x1 - y1, x2 - y2, 2 * b));
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
int stx = floor(double(x1 + y1) / double(2 * a)),
sty = floor(double(x1 - y1) / double(2 * b)),
finx = floor(double(x2 + y2) / double(2 * a)),
finy = floor(double(x2 - y2) / double(2 * b));
if (abs(finx - stx) > abs(finy - sty))
cout << abs(finx - stx);
else
cout << abs(finy - sty);
return 0;
}
|
#include <bits/stdc++.h>
bool DEBUG = false;
using namespace std;
int a, b;
pair<int, int> get_coords(pair<int, int> p) {
pair<int, int> result;
result.first = (p.first + p.second) / (2 * a);
if (p.first + p.second < 0) result.first--;
result.second = (p.second - p.first) / (2 * b);
if (p.second - p.first < 0) result.second--;
return result;
}
int main() {
pair<int, int> p1, p2;
cin >> a >> b >> p1.first >> p1.second >> p2.first >> p2.second;
if (DEBUG) {
cout << "p1"
<< ": (" << (p1).first << ";" << (p1).second << ")" << endl;
};
if (DEBUG) {
cout << "p2"
<< ": (" << (p2).first << ";" << (p2).second << ")" << endl;
};
p1 = get_coords(p1);
p2 = get_coords(p2);
if (DEBUG) {
cout << "p1"
<< ": (" << (p1).first << ";" << (p1).second << ")" << endl;
};
if (DEBUG) {
cout << "p2"
<< ": (" << (p2).first << ";" << (p2).second << ")" << endl;
};
p1.first -= p2.first;
p1.second -= p2.second;
if (DEBUG) {
cout << "p1"
<< ": (" << (p1).first << ";" << (p1).second << ")" << endl;
};
p1.first = ((p1.first) < 0 ? (-(p1.first)) : (p1.first));
p1.second = ((p1.second) < 0 ? (-(p1.second)) : (p1.second));
if (DEBUG) {
cout << "p1"
<< ": (" << (p1).first << ";" << (p1).second << ")" << endl;
};
cout << ((p1.first) > (p1.second) ? (p1.first) : (p1.second));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int powmod(long long int a, int b, int n) {
long long int rm = 1;
while (b) {
if (b % 2) {
rm = (rm * a) % n;
}
a = (a * a) % n;
b /= 2;
}
return rm;
}
int main() {
long long int a, b, x1, x2, y1, y2;
long long int ans = 0;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long int a2 = a * 2, b2 = b * 2;
long long int r = ((x1 + y1) % a2 + a2) % a2;
long long int ynew1 = y1 - r;
long long int v1 = (x1 + ynew1) / a2;
r = ((x2 + y2) % a2 + a2) % a2;
ynew1 = y2 - r;
long long int v2 = (x2 + ynew1) / a2;
long long int bl1 = abs(v2 - v1);
r = ((x1 - y1) % (2 * b) + b2) % b2;
long long int xnew1 = x1 - r;
v1 = (xnew1 - y1) / (2 * b);
r = ((x2 - y2) % b2 + b2) % b2;
xnew1 = x2 - r;
v2 = (xnew1 - y2) / b2;
long long int bl2 = abs(v2 - v1);
if (bl1 > bl2)
cout << bl1 << endl;
else
cout << bl2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INFint = 2e9;
const long long INF = 2e18;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
long long x, y, x1, y1, a, b;
cin >> a >> b >> x >> y >> x1 >> y1;
long long px = x;
x += y;
y = px - y;
px = x1;
x1 += y1;
y1 = px - y1;
a *= 2;
b *= 2;
x = x / a + (x > 0);
y = y / b + (y > 0);
x1 = x1 / a + (x1 > 0);
y1 = y1 / b + (y1 > 0);
cout << max(abs(x - x1), abs(y - y1));
fprintf(stderr, "\nTIME = %lf\n", 1.0 * clock() / CLOCKS_PER_SEC);
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct point {
int x, y, sx, sy;
void zip_cords(int a, int b) {
if (y - x < 0)
sy = (y - x) / (2 * b) - 1;
else
sy = (y - x) / (2 * b);
if (y + x < 0)
sx = (y + x) / (2 * a) - 1;
else
sx = (y + x) / (2 * a);
}
void init(int a, int b) {
scanf("%d%d", &x, &y);
zip_cords(a, b);
}
};
int a, b, n, m;
point f, t;
int main() {
scanf("%d%d", &a, &b);
f.init(a, b);
t.init(a, b);
n = abs(f.sx - t.sx) + 1;
m = abs(f.sy - t.sy) + 1;
printf("%d", max(n, m) - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5, M = 1e6 + 5, C = 1e3 + 5, MOD = 1e9 + 7,
OO = 1e9 + 5;
long long a, b, x1, x2, y_1, y2;
long long addLine(long long mul, long long x) { return mul * a - x; }
long long subLine(long long mul, long long x) { return mul * b + x; }
pair<long long, long long> getLines(long long x, long long y) {
long long st = -OO, en = OO;
while (st <= en) {
long long mid = (st + en) / 2;
if (addLine(mid, x) < y) {
st = mid + 1;
} else {
en = mid - 1;
}
}
pair<long long, long long> res;
res.first = st - 1;
st = -OO, en = OO;
while (st <= en) {
long long mid = (st + en) / 2;
if (subLine(mid, x) < y) {
st = mid + 1;
} else {
en = mid - 1;
}
}
res.second = st - 1;
return res;
}
int main() {
cin.sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> a >> b >> x1 >> y_1 >> x2 >> y2;
a *= 2;
b *= 2;
pair<long long, long long> pt1 = getLines(x1, y_1);
pair<long long, long long> pt2 = getLines(x2, y2);
long long diff1 = abs(pt1.first - pt2.first);
long long diff2 = abs(pt1.second - pt2.second);
cout << max(diff1, diff2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x1, x2, y1, y2, a, b;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a <<= 1;
b <<= 1;
long long xx1 = x1 + y1, yy1 = x1 - y1;
long long xx2 = x2 + y2, yy2 = x2 - y2;
xx1 -= (xx1 % a + a) % a;
xx2 -= (xx2 % a + a) % a;
yy1 -= (yy1 % b + b) % b;
yy2 -= (yy2 % b + b) % b;
cout << max(abs(xx1 - xx2) / a, abs(yy1 - yy2) / b) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, x, y, x2, y2;
int f(int x) { return (x >= 0 ? x : -x); }
int g(int x, int y) {
if (x >= 0) return x / y;
return x / y - 1;
}
int main() {
ios::sync_with_stdio(false);
cin >> a >> b >> x >> y >> x2 >> y2;
a *= 2;
b *= 2;
cout << max(f(g(x + y, a) - g(x2 + y2, a)), f(g(x - y, b) - g(x2 - y2, b)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
void solve() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
int yellow_id = (x1 - y1) / (b << 1);
if (x1 - y1 < 0) --yellow_id;
int yellow_id2 = (x2 - y2) / (b << 1);
if (x2 - y2 < 0) --yellow_id2;
int blue_id = (x1 + y1) / (a << 1);
if (x1 + y1 < 0) --blue_id;
int blue_id2 = (x2 + y2) / (a << 1);
if (x2 + y2 < 0) --blue_id2;
cout << max(((yellow_id - yellow_id2) >= 0 ? (yellow_id - yellow_id2)
: -(yellow_id - yellow_id2)),
((blue_id - blue_id2) >= 0 ? (blue_id - blue_id2)
: -(blue_id - blue_id2)))
<< '\n';
}
int main() {
fastIO();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b;
bool bad(int x, int y) {
return abs(x + y) % (2 * a) == 0 || abs(x - y) % (2 * b) == 0;
}
void reorder(int& x, int& y) {
int xx = (x - y) / 2;
int yy = (x + y) / 2;
x = xx;
y = yy;
}
void norm(int& x, int& y) {
if ((x + y) % 2 == 0) return;
if (!bad(x + 1, y))
x++;
else if (!bad(x - 1, y))
x--;
else if (!bad(x, y + 1))
y++;
else if (!bad(x, y - 1))
y--;
}
int torect(int x, int a) {
if (x <= 0)
return x / a;
else
return x / a + 1;
}
int main() {
int x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
norm(x1, y1);
norm(x2, y2);
reorder(x1, y1);
reorder(x2, y2);
x1 = torect(x1, b);
x2 = torect(x2, b);
y1 = torect(y1, a);
y2 = torect(y2, a);
int dx = abs(x1 - x2);
int dy = abs(y1 - y2);
int ans = max(dx, dy);
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e9;
int main() {
long long a, b, x1, y1, x2, y2;
scanf("%lld %lld %lld %lld %lld %lld", &a, &b, &x1, &y1, &x2, &y2);
long long sum1 = x1 + y1, sum2 = x2 + y2;
long long diff1 = x1 - y1, diff2 = x2 - y2;
sum1 += N * 2 * a;
sum2 += N * 2 * a;
diff1 += N * 2 * b;
diff2 += N * 2 * b;
long long A1 = sum1 / (2 * a) + (sum1 % (2 * a) == 0);
long long A2 = sum2 / (2 * a) + (sum2 % (2 * a) == 0);
long long B1 = diff1 / (2 * b);
long long B2 = diff2 / (2 * b);
printf("%lld\n", max(abs(A1 - A2), abs(B1 - B2)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
int xa = (x1 + y1) / (a * 2) + (x1 + y1 > 0);
int xb = (x2 + y2) / (a * 2) + (x2 + y2 > 0);
int ya = (y1 - x1) / (b * 2) + (y1 - x1 > 0);
int yb = (y2 - x2) / (b * 2) + (y2 - x2 > 0);
if (abs(yb - ya) > abs(xb - xa))
cout << abs(yb - ya);
else
cout << abs(xb - xa);
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const double eps = 1e-9;
int main() {
long long a, b, x1, y1, x2, y2;
while (cin >> a >> b >> x1 >> y1 >> x2 >> y2) {
int a1 = (x1 + y1) / (2 * a), a2 = (x2 + y2) / (2 * a);
int b1 = (x1 - y1) / (2 * b), b2 = (x2 - y2) / (2 * b);
if (x1 + y1 < 0 && (x1 + y1) % (2 * a)) {
--a1;
}
if (x2 + y2 < 0 && (x2 + y2) % (2 * a)) {
--a2;
}
if (x1 - y1 < 0 && (x1 - y1) % (2 * b)) {
--b1;
}
if (x2 - y2 < 0 && (x2 - y2) % (2 * b)) {
--b2;
}
int aa = abs(a1 - a2);
int bb = abs(b1 - b2);
cout << max(aa, bb) << endl;
}
return 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1E-9;
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double PI = 2 * acos(.0);
int main() {
int a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a *= 2;
b *= 2;
int m1 = min(x1 + y1, x2 + y2);
int m2 = max(x1 + y1, x2 + y2);
int mm1 = min(x1 - y1, x2 - y2);
int mm2 = max(x1 - y1, x2 - y2);
cout << max((m2 / a) - (m1 / a) + ((m2 > 0 && m1 < 0) ? 1 : 0),
mm2 / b - mm1 / b + ((mm2 > 0 && mm1 < 0) ? 1 : 0))
<< endl;
return 0;
}
|
#include <bits/stdc++.h>
int getagroup(int x, int y, int num);
int getbgroup(int x, int y, int num);
int main(void) {
int a, b, x1, x2, y1, y2;
int ga1, ga2, gb1, gb2;
int difa, difb, ans;
scanf("%d %d %d %d %d %d", &a, &b, &x1, &y1, &x2, &y2);
ga1 = getagroup(x1, y1, a);
ga2 = getagroup(x2, y2, a);
gb1 = getbgroup(x1, y1, b);
gb2 = getbgroup(x2, y2, b);
difa = (((ga1 - ga2) < 0) ? (-(ga1 - ga2)) : (ga1 - ga2));
difb = (((gb1 - gb2) < 0) ? (-(gb1 - gb2)) : (gb1 - gb2));
ans = (((difa) > (difb)) ? (difa) : (difb));
printf("%d\n", (((difa) > (difb)) ? (difa) : (difb)));
return 0;
}
int getagroup(int x, int y, int num) {
int n;
n = x + y;
if (n >= 0)
n /= (2 * num);
else {
n /= (2 * num);
n--;
}
return n;
}
int getbgroup(int x, int y, int num) {
int n;
n = x - y;
if (n >= 0)
n /= (2 * num);
else {
n /= (2 * num);
n--;
}
return n;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, aa, bb, cc, dd, k, n, S, SS, SSS, ANS, m, kk, B, AAA, nn, N, M,
M1, M2, M3, ANS1, ANS2, xx, yy, x, y;
double r, VV;
int main() {
scanf("%d %d %d %d %d %d", &a, &b, &x, &y, &xx, &yy);
a = a * 2;
b = b * 2;
if (((x + y) >= 0 && (xx + yy) >= 0) || ((x + y) <= 0 && (xx + yy) <= 0))
ANS1 = abs(abs(x + y) / a - abs(xx + yy) / a);
else
ANS1 = abs(abs(x + y) / a + abs(xx + yy) / a) + 1;
if (((x - y) >= 0 && (xx - yy) >= 0) || ((x - y) <= 0 && (xx - yy) <= 0))
ANS2 = abs(abs(x - y) / b - abs(xx - yy) / b);
else
ANS2 = abs(abs(x - y) / b + abs(xx - yy) / b) + 1;
printf("%d\n", max(ANS1, ANS2));
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll FLO(ll a, ll b) { return a + b; }
int main() {
double a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
ll shell1 = floor((x1 + y1) / (a + a));
ll shell2 = floor((x2 + y2) / (a + a));
ll gap1 = floor((x1 - y1) / (b + b));
ll gap2 = floor((x2 - y2) / (b + b));
cout << max(abs(shell1 - shell2), abs(gap1 - gap2)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long f(int x, int y) { return abs((x) / y); }
long long solve(long long x1, long long x2, long long b) {
if (x1 > x2) swap(x1, x2);
long long ans = 0;
ans += x2 / b;
if (x1 <= 0)
ans += abs(x1) / b;
else
ans -= (x1 - 1) / b;
if (x2 >= 0 && x1 <= 0) ans++;
return ans;
}
int main() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a <<= 1, b <<= 1;
long long xr = (x1 + y1), yr = (x1 - y1);
long long xp = (x2 + y2), yp = (x2 - y2);
cout << max(solve(xr, xp, a), solve(yr, yp, b)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, x0, y0, x1, y1;
cin >> a >> b >> x0 >> y0 >> x1 >> y1;
long long ac = (long long)floor((double)(y0 - x0) / (2 * b) + 1e-11);
ac -= (long long)floor((double)(y1 - x1) / (2 * b) + 1e-11);
ac = abs(ac);
long long ab = (long long)floor((double)(y0 + x0) / (2 * a) + 1e-11);
ab -= (long long)floor((double)(y1 + x1) / (2 * a) + 1e-11);
ab = abs(ab);
cout << max(ab, ac);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1000 * 1000 * 1000;
const int mx[5] = {0, -1, 0, 1, 0};
const int my[5] = {0, 0, -1, 0, 1};
struct pt {
long long x, y;
};
long long a, b;
pt s, f, v, u;
pt convert(pt p) {
long long l = -inf;
long long r = inf;
pt q;
while (l < r - 1) {
long long m = (l + r) / 2;
if (p.y >= 2 * a * m - p.x)
l = m;
else
r = m;
}
q.x = l;
l = -inf;
r = inf;
while (l < r - 1) {
long long m = (l + r) / 2;
if (p.y >= 2 * b * m + p.x)
l = m;
else
r = m;
}
q.y = l;
return q;
}
long long dist(pt a, pt b) {
long long dx = abs(a.x - b.x);
long long dy = abs(a.y - b.y);
long long d = min(dx, dy);
dx -= d;
dy -= d;
return d + dx + dy;
}
int main() {
scanf("%I64d %I64d", &a, &b);
scanf("%I64d %I64d", &s.x, &s.y);
scanf("%I64d %I64d", &f.x, &f.y);
long long res = inf;
v = convert(s);
u = convert(f);
res = dist(v, u);
printf("%I64d", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7f7f7f7f;
const int maxn = 511;
template <typename T>
T ABS(T n) {
return n > 0 ? n : -n;
}
void tran(long long &x, long long &y) {
long long x0 = x, y0 = y;
x = x0 - y0, y = x0 + y0;
}
int main() {
ios::sync_with_stdio(false);
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long x, y;
a <<= 1, b <<= 1;
tran(x1, y1);
tran(x2, y2);
x = ABS(x1 / b - x2 / b);
y = ABS(y1 / a - y2 / a);
if (x1 * x2 < 0) x++;
if (y1 * y2 < 0) y++;
cout << max(x, y) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
void solve() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
long long yellow_id = (x1 - y1) / (b << 1);
if (x1 - y1 < 0) --yellow_id;
long long yellow_id2 = (x2 - y2) / (b << 1);
if (x2 - y2 < 0) --yellow_id2;
long long blue_id = (x1 + y1) / (a << 1);
if (x1 + y1 < 0) --blue_id;
long long blue_id2 = (x2 + y2) / (a << 1);
if (x2 + y2 < 0) --blue_id2;
cout << max(((yellow_id - yellow_id2) >= 0 ? (yellow_id - yellow_id2)
: -(yellow_id - yellow_id2)),
((blue_id - blue_id2) >= 0 ? (blue_id - blue_id2)
: -(blue_id - blue_id2)))
<< '\n';
}
int32_t main() {
fastIO();
solve();
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
long long div_(long long a, long long b) {
if (a >= 0) return a / b;
return (a - b + 1) / b;
}
long long abs_(long long a) { return (a > 0) ? a : -a; }
int main() {
long long a, b, x1, y1, x2, y2;
cin >> a >> b >> x1 >> y1 >> x2 >> y2;
a *= 2;
b *= 2;
long long dx1 = div_(x1 + y1, a);
long long dy1 = div_(x1 - y1, b);
long long dx2 = div_(x2 + y2, a);
long long dy2 = div_(x2 - y2, b);
cout << max(abs_(dx1 - dx2), abs_(dy1 - dy2)) << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.