Submission #330444

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cstdio>

using namespace std;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

const int kM = 1002, kQ = 1002;

int N, M;
int A[kM], B[kM], C[kM];

int Q;
int D[kQ], E[kQ], F[kQ];

bool user[202][202];  // by constraints
bool tmp[202][202];

void solve() {
  if (N > 200 || M > 200 || Q > 200) {
    for (int i = 0; i < Q; i++) puts("-1");
  }

  memset(user, 0, sizeof user);
  for (int i = 0; i < M; i++) {
    int a = A[i], b = B[i], c = C[i];
    for (int j = 1; j <= c; j++) {
      for (int k = 1; k <= j; k++) {
        int la = a + j - 1;
        int lb = b + k - 1;
        if (lb > la) continue;
        user[la][lb] = 1;
      }
    }
  }

  for (int i = 0; i < Q; i++) {
    int d = D[i], e = E[i], f = F[i];
    int val = 0;

    memcpy(tmp, user, sizeof user);

    for (int j = 1; j <= f; j++) {
      for (int k = 1; k <= j; k++) {
        int ld = d + j - 1;
        int le = e + k - 1;

        if (!tmp[ld][le]) {
          tmp[ld][le] = 1;
          ++val;
        }
      }
    }
    printf("%d\n", val);
  }
}

int main() {
  while (cin >> N >> M) {
    for (int i = 0; i < M; i++) {
      cin >> A[i] >> B[i] >> C[i];
    }
    cin >> Q;
    for (int i = 0; i < Q; i++) {
      cin >> D[i] >> E[i] >> F[i];
    }
    solve();
  }
  return 0;
}

Submission Info

Judge Result