結果

問題 No.325 マンハッタン距離2
ユーザー heno239
提出日時 2020-08-27 16:36:42
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 3,869 bytes
コンパイル時間 1,013 ms
コンパイル使用メモリ 111,832 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 20:32:08
合計ジャッジ時間 1,956 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 1;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


void solve() {
	ll x1, y1, x2, y2, d;
	cin >> x1 >> y1 >> x2 >> y2 >> d;
	ll mx1 = x1, mx2 = x2, my1 = y1, my2 = y2;
	ll ans = 0;
	rep(i, 4) {
		if (x1 > x2)swap(x1, x2);
		if (y1 > y2)swap(y1, y2);

		if (x2>=0&&y2>=0&&x2 + y2 <= d) {
			ll cx = x2 - max(0ll, x1) + 1;
			ll cy = y2 - max(1ll, y1)+1;
			ans += cx * cy;
		}
		else {
			ll lx = max((ll)0, x1);
			ll rx = x2;
			ll ly = max((ll)1, y1);
			ll ry = y2;

			ll ltx = max(lx, d - ry);
			ll rtx = min(rx, d - ly);
			ll lty = d - rtx;
			ll rty = d - ltx;

			ll csum = 0;
			if (rtx >= ltx) {
				ll num = rtx - ltx + 1;
				if (num >= 0) {
					csum += num * (num + 1) / 2;
				}
				ll cx = ltx - lx;
				ll cy = rty - ly + 1;
				csum += cx * cy;
				cx = rtx - lx + 1;
				cy = lty - ly;
				csum += cx * cy;
				cx = ltx - lx, cy = lty - ly;
				csum -= cx * cy;

			}
			//cout << i << " " << csum << "\n";
			//cout << ltx << " " << rtx << " " << lty << " " << rty << "\n";
			ans += csum;
		}
		swap(mx1, my1); mx1 *= -1;
		swap(mx2, my2); mx2 *= -1;
		x1 = mx1, x2 = mx2, y1 = my1, y2 = my2;
	}
	if (x1 <= 0 && x2 >= 0 && y1 <= 0 && y2 >= 0)ans++;
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0