# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171822 | LaMatematica14 | Mosaic (IOI24_mosaic) | C++20 | 1098 ms | 2162688 KiB |
#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<int>> l(N, vector<int> (N, -1));
l[0] = X;
for (int i = 0; i < N; i++) l[i][0] = Y[i];
for (int i = 1; i < N; i++) {
for (int j = 1; j < N; j++) l[i][j] = !(l[i][j-1]||l[i-1][j]);
}
int M = T.size();
vector<long long> ans(M);
for (int i = 0; i < M; i++) {
for (int x = L[i]; x <= R[i]; x++) {
for (int y = T[i]; y <= B[i]; y++) ans[i] += l[y][x];
}
}
return ans;
}
# | 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... |