J - seerc 2014

#include <bits/stdc++.h>

using namespace std;

struct Triangle {
  int add_l, add_c;
  int sub_l, sub_c;
  int o;
  Triangle () {}
  Triangle (int _add_l, int _add_c, int _sub_l, int _sub_c, int _o) :
    add_l (_add_l), add_c (_add_c), sub_l (_sub_l), sub_c (_sub_c), o (_o) {}
};

const int NMAX = 3e4 + 5;

Triangle a[NMAX];
int curr[NMAX];

int n, m, ans;

void press (int col) {
  col -= n;
  if (col < 0 || col >= n) return;
  curr[col] ^= 1;
  if (curr[col]) ++ans;
  else --ans;
}

int main() {
  freopen ("j.in", "r", stdin);
  scanf ("%d\n%d\n", &n, &m);
  for (int i = 1; i <= m; ++i) {
    int l, c, p, o;
    scanf ("%d %d %d %d\n", &l, &c, &p, &o);
    l += n, c += n;
    if (o == 0) {
      --c; // mersi rares
      a[i] = {l, c - p + 1, l + p, c, o};
    } else if (o == 1) {
      a[i] = {l, c, l + p, c + p - 1, o};
    } else if (o == 2) {
      --l;
      a[i] = {l - p + 1, c, l + 1, c, o};
    } else if (o == 3) {
      --l;
      --c;
      a[i] = {l - p + 1, c, l + 1, c, o};
    }
//    printf ("%d %d %d %d %d\n", a[i].add_l, a[i].add_c, a[i].sub_l, a[i].sub_c, a[i].o);
  }

  int res = 0;
  for (int row = 1; row <= 3 * n; ++row) {
    for (int i = 1; i <= m; ++i) {
      if (row < a[i].add_l || row > a[i].sub_l) {
        continue;
      }
      if (row == a[i].add_l || row == a[i].sub_l) {
        for (int col = a[i].add_c; col <= a[i].sub_c; ++col) {
          press (col);
        }
        continue;
      }
      int o = a[i].o;
      if (o == 0) {
        press (a[i].add_c);
        ++a[i].add_c;
      } else if (o == 1) {
        press (a[i].sub_c);
        --a[i].sub_c;
      } else if (o == 2) {
        ++a[i].add_c;
        press (a[i].add_c);
      } else {
        --a[i].sub_c;
        press (a[i].sub_c);
      }
    }
    if (row - n >= 0 && row - n < n)
      res += ans;
  }

  printf ("%d\n", res);

  fclose (stdin);
  return 0;
}