#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){
//subtask 1,2
int n=x.size();
int q=t.size();
vector<long long> ans(q,0);
vector<vector<int>> grid(n,vector<int>(n));
for(int i=0;i<n;i++){
grid[i][0]=y[i];
for(int j=1;j<n;j++){
if(i==0) grid[i][j]=x[j];
else{
if(grid[i-1][j]==0&&grid[i][j-1]==0){
grid[i][j]=1;
}else grid[i][j]=0;
}
}
}
for(int query=0;query<q;query++){
int cnt=0;
for(int i=t[query];i<=b[query];i++){
for(int j=l[query];j<=r[query];j++){
if(grid[i][j]==1) cnt++;
}
}
ans[query]=cnt;
}
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... |