Submission #74126361

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef vector<int> vi;
typedef vector<ll> vll;
#define SZ(x) ((int)x.size())
ll ksm(ll a,ll b,ll p){if (p == 1)return 0;if (b == 0)return 1%p;
ll ans = 1;	a %= p;while (b > 0){if (b&1){ans = ans*a%p;}a = (a*a)
%p;b >>= 1;}return ans;}
const int mod = 1e9+7;
const int P = 998244353;
const ll inf = (1LL << 50LL);
const ll N = 1010;

ll solve(ll L, ll R, ll D, ll U) {
    ll count = 0;
    ll mc = max({abs(L), abs(R), abs(D), abs(U)});
    for (ll layer = 0; layer <= mc; layer++) {
        if (layer % 2 == 0) {
            ll startX = max(-layer, L);
            ll endX = min(layer, R);
            ll startY = max(-layer, D);
            ll endY = min(layer, U);
            if (startX <= endX && startY <= endY) {
                ll lc = 0;
                ll tot = (min(layer, R) - max(-layer, L) + 1) * 
                                        (min(layer, U) - max(-layer, D) + 1);
                if (layer > 0) {
                    ll tpl = (min(layer-1, R) - max(-layer+1, L) + 1) * 
                                                (min(layer-1, U) - max(-layer+1, D) + 1);
                    lc = tot - tpl;
                } else {
                    lc = 1; 
                }
                
                count += lc;
            }
        }
    }
    
    return count;
}

int main() {
    ll L, R, D, U;
    cin >> L >> R >> D >> U;
    
    ll result = solve(L, R, D, U);
    cout << result << endl;
    
    return 0;
}

Submission Info

Judge Result