| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1243626 | alexander707070 | Mosaic (IOI24_mosaic) | C++20 | 73 ms | 30016 KiB |
#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;
int n,q;
int t[5007][5007];
int row[5][MAXN],col[5][MAXN];
vector<long long> mosaic(vector<int> X, vector<int> Y,vector<int> T, vector<int> B,vector<int> L, vector<int> R){
n=int(X.size());
q=int(T.size());
for(int i=1;i<=n;i++){
row[1][i]=X[i-1];
col[1][i]=Y[i-1];
t[1][i]=X[i-1]; t[i][1]=Y[i-1];
}
for(int i=2;i<=n;i++){
for(int f=2;f<=n;f++){
if(t[i-1][f]==0 and t[i][f-1]==0)t[i][f]=1;
}
}
for(int i=4;i<=n;i++){
for(int f=4;f<=n;f++){
assert(t[i][f]==t[i-1][f-1]);
}
}
}
/*int main(){
mosaic({1,1,1,0,0,0,1,1,0,1,0,1,1,1,0},{1,1,1,0,0,0,1,1,0,1,0,1,1,1,0},{},{},{},{});
//auto yo=mosaic({0,0,0,0,0}, {0,0,0,0,0}, {1, 0}, {4, 3}, {2,0}, {4,3});
//for(auto s:yo)cout<<s<<" ";
return 0;
}*/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... | ||||
