#include <bits/stdc++.h> using namespace std; vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) { int N = X.size(); vector<vector<bool>> full(N, vector<bool>(N)); for (int i = 0; i < N; i++) { full[0][i] = X[i]; full[i][0] = Y[i]; } for (int i = 1; i < N; i++) { for (int j = 1; j < N; j++) { full[i][j] = not(full[i-1][j] or full[i][j-1]); } } int Q = T.size(); vector<long long> C(Q, 0); for (int k = 0; k < Q; k++) { for (int i = T[k]; i <= B[k]; i++) { for (int j = L[k]; j <= R[k]; j++) { if (full[i][j]) { C[k]++; } } } } return C; }