Submission #45138470

---

Source Code Expand

/*
  2023/9/2
  ABC318 B
*/


//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int  INF = 2147483647;
const ll  INF2 = 9223372036854775807;
const ll  MOD = 998244353;
const int  MOD2 = 1000000007;
const double PI = 3.14159263589793;
const long double EPS = 1e-14;

int main(){
  int n;
  cin >> n;

  vector<pair<int,int>> x,y;

  for(int i = 0; i < n; i++){
    int a,b,c,d;
    cin >> a >> b >> c >> d;
    x.push_back({a,b});
    y.push_back({c,d});
  }

  vector<vector<bool>> ans(110,vector<bool> (110,false));

  for(int i = 0; i < n; i++){
    for(int j = x[i].first; j < x[i].second; j++){
      for(int k = y[i].first; k < y[i].second; k++){
        ans[j][k] = true;
      }
    }
  }

  int count = 0;

  for(int i = 0; i < 100; i++){
    for(int j = 0; j < 100; j++){
      if(ans[i][j]){
        count++;
      }
    }
  }

  cout << count << endl;

}

Submission Info

Judge Result