Submission #74120267

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 5e5 + 10, M = 2e6 + 10, mod = 998244353, INF = 0x3ffffffff, LOG = 23;
const long double PI = 3.141592653589793;

/*
int e[M], h[N], ne[M], idx;
inline void add(int u, int v){
    e[idx] = v, ne[idx] = h[u], h[u] = idx ++;
}
*/
int qpow(int x, int d){
    int res = 1;
    while(d){
        if(d & 1){
            res *= x;
        }
        x = (x * x) % mod;
        d >>= 1;
    }
    return res;
}

int __mod(int a){
    return ((a % mod) + mod) % mod;
}

int l, r, u, d;

int mat(int up, int ri){
    up = abs(up);
    ri = abs(ri);
    int cup = up >> 1;
    int cri = ri >> 1;
    int mn = min(cup, cri);
    int res = 2 * mn * mn + 3 * mn + 1;
    int mx = max(cup, cri);
    res += (mx - mn) * (min(up, ri) + 1);
    return res;
}

int mat_(int up, int down, int left, int right){
    up = abs(up), down = abs(down), left = abs(left), right = abs(right);
    return mat(up, right) - mat(up, left) - mat(down, right) + mat(down, left);
}

int line(int d){
    return (d >> 1) + 1;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    // memset(h, -1, sizeof h);
    cin >> l >> r >> u >> d;
    int ans = 0;
    if(l < 0 && u > 0){
        ans += mat_(u, max(d, 1ll), l, min(r, -1ll));
    }
    if(r > 0 && u > 0){
        ans += mat_(u, max(d, 1ll), max(l, 1ll), r);
    }
    if(r > 0 && d < 0){
        ans += mat_(min(u, -1ll), d, max(l, 1ll), r);
    }
    if(l < 0 && d < 0){
        ans += mat_(min(u, -1ll), d, l, min(r, -1ll));
    }
    if(l <= 0 &&r >= 0){
        ans += line(u-d);
    }
    if(u >= 0 && d <= 0){
        ans += line(r-l);
    }
    if(l <= 0 &&r >= 0&&u >= 0 && d <= 0) ans --;
    cout << ans;
    return 0;
}

Submission Info

Judge Result