Submission #73386414

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ff first
#define ss second
using namespace std;
using namespace __gnu_pbds;
const int INF = 1e9;
const ll MOD = 1e9 + 7;

struct seg {
    int n;
    vector<int> t;
    seg(int n): n(n), t(4*n, 1) {}
    void upd(int id, int v, int x, int lx, int rx){
        if (lx == rx) {
            t[x] = v;
            return;
        }
        int m = (lx + rx) / 2;
        if (id <= m) upd(id, v, x*2, lx, m);
        else upd(id, v, x*2+1, m+1, rx);
        t[x] = t[x*2] * t[x*2+1];
    }
    void upd(int id, int v) {
        upd(id, v, 1, 1, n);
    }
    int qry(int l, int r, int x, int lx, int rx){
        if (r < lx || rx < l) return 1;
        if (l <= lx && rx <= r) return t[x];
        int m = (lx + rx) / 2;
        return qry(l, r, x*2, lx, m) *
               qry(l, r, x*2+1, m+1, rx);
    }
    int qry(int l, int r) {
        return qry(l, r, 1, 1, n);
    }
};

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, a, b;
    cin >> n >> a >> b;
    static int g[501][501] = {};
    for(int i = 0; i < a; i++) {
        int r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2;
        for (int r = r1; r <= r2; r++) {
            for (int c = c1; c <= c2; c++) {
                g[r][c] |= 1;
            }
        }
    }
    for (int i = 0; i < b; i++) {
        int r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2;
        for (int r = r1; r <= r2; r++) {
            for (int c = c1; c <= c2; c++) {
                g[r][c] |= 2;
            }
        }
    }
    int ans = 0;
    for (int r = 1; r <= n; r++) {
        for (int c = 1; c <= n; c++) {
            if (g[r][c] == 3) ans++;
        }
    }
    cout << ans;
}

Submission Info

Judge Result