Submission #74099360

---

Source Code Expand

// Problem: D - Make Target 2
// Contest: AtCoder - AtCoder Beginner Contest 449
// URL: https://atcoder.jp/contests/abc449/tasks/abc449_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//空中散歩の SOS 僕ファー　僕ファー　僕ファー ~
#include<bits/stdc++.h>
using namespace std;
// --- Types ---
using ll = long long;
using db = double; 
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using poly = vi;

// --- Macros ---
#define fi first
#define se second
#define endl '\n'
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define unq(v) (v).erase(unique(all(v)), (v).end())

// --- Loops ---
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define per(i, a, b) for(int i = (a); i >= (b); --i)
#define fore(x, a) for(auto& x : a)

// --- Utils ---
template<class T> bool chmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool chmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll calc(ll xx,ll xy,ll yx,ll yy,ll L,ll R,ll D,ll U){
	ll len1=0;
	ll l=max(xx,L),r=min(xy,R);
	if(l<=r)len1=r-l+1;
	ll len2=0;
	l=max(yx,D),r=min(yy,U);
	if(l<=r)len2=r-l+1;
	return len1*len2;
}

void solve(){
	ll L,R,D,U;
	cin>>L>>R>>D>>U;
	ll ans=0;
	per(i,1000000,0){
		ll del=calc(-i,i,-i,i,L,R,D,U);
		if(i&1)ans-=del;
		else ans+=del;
	}
	cout<<ans<<endl;
	return ;
}
ll T=1;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
//	cin>>T;
	for(ll kase=1;kase<=T;kase++){
		solve();
	}
	return 0;
}

Submission Info

Judge Result