Submission #73388033

---

Source Code Expand

// awc0007 D - Investigation of Overlapping Advertisement Areas
#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;
using namespace atcoder;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int N, A, B;
  cin >> N >> A >> B;
  vector<vector<int>> TileA(N + 1, vector<int>(N + 1, 0));
  vector<vector<int>> TileB(N + 1, vector<int>(N + 1, 0));
  for (int i = 0; i < A; i++) {
    int r1, c1, r2, c2;
    cin >> r1 >> c1 >> r2 >> c2;
    TileA[r1 - 1][c1 - 1]++;
    TileA[r1 - 1][c2]--;
    TileA[r2][c1 - 1]--;
    TileA[r2][c2]++;
  }
  for (int i = 0; i < B; i++) {
    int r1, c1, r2, c2;
    cin >> r1 >> c1 >> r2 >> c2;
    TileB[r1 - 1][c1 - 1]++;
    TileB[r1 - 1][c2]--;
    TileB[r2][c1 - 1]--;
    TileB[r2][c2]++;
  }
  for (int i = 1; i < N; i++) {
    for (int j = 0; j < N; j++) {
      TileA[i][j] += TileA[i - 1][j];
      TileB[i][j] += TileB[i - 1][j];
    }
  }
  for (int i = 0; i < N; i++) {
    for (int j = 1; j < N; j++) {
      TileA[i][j] += TileA[i][j - 1];
      TileB[i][j] += TileB[i][j - 1];
    }
  }
  int count = 0;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      if (TileA[i][j] > 0 && TileB[i][j] > 0) count++;
    }
  }
  cout << count << endl;
  return 0;
}

Submission Info

Judge Result