#include <bits/stdc++.h>
#include "mosaic.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(), q = T.size();
vector<long long> ret;
for (int i = 0; i < q; i++) {
int t = T[i], b = B[i], l = L[i], r = R[i];
if (t == 0) {
if (b == 0) {
ret.push_back(0);
continue;
}
t++;
}
if (l == 0) {
if (r == 0) {
ret.push_back(0);
continue;
}
l++;
}
int w = r - l + 1, h = t - b + 1;
if (w % 2 == 1 && h % 2 == 1) {
ret.push_back((w * h + 1) / 2);
} else {
ret.push_back(w * h / 2);
}
}
return ret;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |