# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171781 | LaMatematica14 | Mosaic (IOI24_mosaic) | C++20 | 88 ms | 27148 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<int> fr(N), sr(N), tr(N);
vector<int> fc(N), sc(N), tc(N);
fr = X;
fc = Y;
sr[0] = fc[1];
for (int i = 1; i < N; i++) sr[i] = !(fr[i]||sr[i-1]);
tr[0] = fc[2];
for (int i = 1; i < N; i++) tr[i] = !(sr[i]||tr[i-1]);
sc[0] = fr[1];
for (int i = 1; i < N; i++) sc[i] = !(fc[i]||sc[i-1]);
tc[0] = fr[2];
for (int i = 1; i < N; i++) tc[i] = !(sc[i]||tc[i-1]);
vector<int> diag(2*N);
int a = 0;
for (int i = N-1; i > 2; i--) diag[a++] = tc[i];
for (int i = 2; i < N; i++) diag[a++] = tr[i];
auto prefixa = [&](vector<int> &a, vector<long long> &p) {
p.resize(a.size()+1);
p[0] = 0;
for (int i = 0; i < a.size(); i++) p[i+1] = p[i]+a[i];
};
# | 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... |