Submission #73394857

---

Source Code Expand

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

template <typename T>
struct Pref2D{
    vector<vector<T>> pref;

    Pref2D(vector<vector<T>> &a){
        int n = a.size(), m = a[0].size();
        pref.resize(n + 1, vector<T>(m + 1, 0));

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                pref[i + 1][j + 1] = a[i][j] + pref[i + 1][j] + pref[i][j + 1] - pref[i][j]; 
            }
        }
    }

    T query(int r1, int c1, int r2, int c2){
        return pref[r2 + 1][c2 + 1] - pref[r1][c2 + 1] - pref[r2 + 1][c1] + pref[r1][c1];
    }
};

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef Fusion15
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    
    int n, a, b;
    cin>>n>>a>>b;

    vector<vector<int>> diff1(n + 1, vector<int>(n + 1, 0));
    vector<vector<int>> diff2(n + 1, vector<int>(n + 1, 0));
    for(int i = 0; i < a; i++){
        int r1, c1, r2, c2;
        cin>>r1>>c1>>r2>>c2;
        diff1[r2][c2]++;
        diff1[r2][c1 - 1]--;
        diff1[r1 - 1][c2]--;
        diff1[r1 - 1][c1 - 1]++;
    }

    for(int i = 0; i < b; i++){
        int r1, c1, r2, c2;
        cin>>r1>>c1>>r2>>c2;
        diff2[r2][c2]++;
        diff2[r2][c1 - 1]--;
        diff2[r1 - 1][c2]--;
        diff2[r1 - 1][c1 - 1]++;
    }

    Pref2D pf1(diff1), pf2(diff2);

    int res = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(pf1.pref[i][j] && pf2.pref[i][j]){
                res++;
            }
        }
    }

    cout<<res;
    
    return 0;
}

Submission Info

Judge Result