提出 #74097106

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

long long solve(int l, int r, int d, int u) {
    if (l > r || d > u) return 0;
    if (r <= 0) l = -l, r = -r, swap(l, r);
    if (u <= 0) d = -d, u = -u, swap(d, u);
    if (l < 0) return solve(l, 0, d, u) + solve(1, r, d, u);
    if (d < 0) return solve(l, r, d, 0) + solve(l, r, 1, u);

    long long points = 0;
    for (int mx = max(l, d); mx <= max(r, u); ++mx) {
        if (mx & 1) continue;
        int rowsUnderMX = (mx > u ? u-d+1 : mx-d);
        int colsLeftOfMX = (mx > r ? r-l+1 : mx-l);
        if (mx <= r) points += rowsUnderMX;
        if (mx <= u) points += colsLeftOfMX;
        if (mx <= r && mx <= u) ++points; // (mx, mx)
    }
    return points;
}

int main() {
    int l, r, d, u;
    cin >> l >> r >> d >> u;
    cout << solve(l, r, d, u) << endl;
    return 0;
}

提出情報

ジャッジ結果