Submission #74114430

---

Source Code Expand

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

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(nullptr);

    int L, R, D, U;
    cin >> L >> R >> D >> U;

    int res = 0;
    for (int i = L; i <= R; ++i) {
        vector<pair<int, int>> arr{{-abs(i), 0}, {abs(i), 0}, {D, 1}, {U, 1}};
        sort(arr.begin(), arr.end());
        int flag1 = 0;
        int flag2 = 0;
        int flag3 = 0;
        for (int j = 0; j < 3; ++j) {
            if (!arr[j].second) {
                flag1 ^= 1;
            }
            if (arr[j].second) {
                flag2 ^= 1;
            }
            if (flag2) {
                arr[j].first += flag3;
                if (flag1) {
                    if (i % 2 == 0) {
                        res += (arr[j + 1].first - arr[j].first + 1);
                    }
                }

                else {
                    res += (arr[j + 1].first - arr[j].first + 1) / 2 + (((arr[j + 1].first - arr[j].first + 1) % 2) && arr[j].first % 2 == 0);
                }

                flag3 = 1;
            }
        }
    }
    cout << res;
}

Submission Info

Judge Result