# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1099886 | model_code | Mosaic (IOI24_mosaic) | C++17 | 393 ms | 123836 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// incorrect/subtask6.cpp
#include "mosaic.h"
#include "bits/stdc++.h"
using namespace std;
const int mxN = 1e6 + 5;
int getLayer(int x, int y) {
return min(x, y);
}
int n;
map<int, int> layers[mxN]; ///holding layers up to 3
int genNor(int x, int y) {
return not (x or y);
}
void genLayers(vector<int> r, vector<int> c) {
int n = r.size();
for(int i = 0; i < n; i++) {
layers[0][i] = r[i];
}
for(int i = 0; i < n; i++) {
layers[i][0] = c[i];
}
for(int layer = 1; layer <= 2; layer++) {
for(int i = layer; i < n; i++) {
layers[layer][i] = genNor(layers[layer-1][i], layers[layer][i-1]);
layers[i][layer] = genNor(layers[i-1][layer], layers[i][layer-1]);
}
}
}
int getOrderInLayer(int x, int y) {
Compilation message (stderr)
# | 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... |