AOJ2747.cpp

#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

using ll = long long;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int x[128], y[128];

int main() {
  int N;
  while (cin >> N, N) {
    vector<tuple<int,int,int>> edge;
    REP(i,N) cin >> x[i] >> y[i];
    REP(i,N)
      if (x[i] == x[(i+1)%N])
        edge.emplace_back(x[i], y[i], y[(i+1)%N]);
    int left = 1e9, right = -1e9, top = 1e9, bot = -1e9;
    int xx, yy;
    REP(i,4) {
      cin >> xx >> yy;
      chmin(left, xx); chmax(right, xx);
      chmin(top, yy); chmax(bot, yy);
    }
    ll res = 0;
    for (auto t: edge) {
      int x1, x2, from, to;
      tie(x1, from, to) = t;
      ll overlap = max(0, min(bot, max(from, to)) - max(top, min(from, to)));
      if (to < from) overlap = -overlap;
      ll not_overlap = to - from - overlap;
      x2 = x1;
      if (x1 > right) x2 -= right - left;
      else if (x1 > left) x2 = left;
      res += not_overlap * x1 + overlap * x2;
    }
    cout << res << endl;
  }
  return 0;
}