Submission #1238867

#TimeUsernameProblemLanguageResultExecution timeMemory
1238867adriines06Mosaic (IOI24_mosaic)C++20
22 / 100
1012 ms2162688 KiB
#include "mosaic.h" #include<bits/stdc++.h> #include <vector> using namespace std; std::vector<long long> mosaic(std::vector<int> X, std::vector<int> Y, std::vector<int> T, std::vector<int> B, std::vector<int> L, std::vector<int> R) { int Q = (int)T.size(); vector<long long> C; int N=(int)X.size(); vector<vector<int>>grid(N,vector<int>(N)); for(int i=0;i<N;i++){ grid[i][0]=Y[i]; grid[0][i]=X[i]; } for(int i=1;i<N;i++){ for(int j=1;j<N;j++){ if(grid[i-1][j]==0 && grid[i][j-1]==0){ grid[i][j]=1; } else{ grid[i][j]=0; } } } vector<vector<int>>pref(N+1,vector<int>(N+1,0)); for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ pref[i][j]=pref[i][j-1]+grid[i-1][j-1]; pref[i][j]+=pref[i-1][j]-pref[i-1][j-1]; } } for(int i=0;i<Q;i++){ int u=T[i]+1,d=B[i]+1,l=L[i]+1,r=R[i]+1; int t=pref[d][r],c1=pref[d][l-1],c2=pref[u-1][r],e=pref[u-1][l-1]; long long ans=t-c1-c2+e; C.push_back(ans); } return C; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...