ABC434 D题求条

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

const int N = 2e3+59;

int n, scnt[N][N], si[N][N], x[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int u, d, l, r;
        cin >> u >> d >> l >> r;
        //计算个数
        scnt[u][l]++;
        scnt[u][r + 1]--;
        scnt[d + 1][l]--;
        scnt[d + 1][r + 1]++;
        //计算每个格子覆盖云朵编号的和
        si[u][l] += i;
        si[u][r + 1] -= i;
        si[d + 1][l] -= i;
        si[d + 1][r + 1] += i;
    }
    //计算前缀和
    for (int i = 0; i <= 2025; i++) {
        for (int j = 1; j <= 2025; j++) {
            scnt[i][j] += scnt[i][j - 1];
            si[i][j] += si[i][j - 1];
        }
    }
    for (int i = 1; i <= 2025; i++) {
        for (int j = 0; j <= 2025; j++) {
            scnt[i][j] += scnt[i - 1][j];
            si[i][j] += si[i - 1][j];
        }
    }
    int sum = 0;
    for (int i = 1; i <= 2000; i++) {
        for (int j = 1; j <= 2000; j++) {
            if (scnt[i][j] == 0)
                sum++;
            if (scnt[i][j] == 1)
                x[si[i][j]]++;
        }
    }
    for (int i = 1; i <= n; i++)
        cout << sum + x[i] << endl;
    return 0;
}