Submission #641921

#TimeUsernameProblemLanguageResultExecution timeMemory
641921HibaKhalilCollecting Mushrooms (NOI18_collectmushrooms)C++14
9 / 100
30 ms3176 KiB
#include<bits/stdc++.h> using namespace std; int main (){ int r,c,d,k; cin>>r>>c>>d>>k; char grid[r][c]; for(int i=0;i<r;i++) { for(int j=0;j<c;j++) { cin>>grid[i][j]; } } int sprinkles[r][c]; for (int i=0;i<r;i++) { for (int j=0;j<c;j++) { sprinkles[i][j]=0; if(i>0)sprinkles[i][j]+=sprinkles[i-1][j]; if(j>0)sprinkles[i][j]+=sprinkles[i][j-1]; if(i>0 && j>0) sprinkles[i][j]-=sprinkles[i-1][j-1]; if(grid[i][j]=='S'){ sprinkles[i][j]++; } } } int res = 0; for(int i=0;i<r;i++) { for(int j=0;j<c;j++) { if(grid[i][j]=='M'){ int i1 , j1 , i2 , j2; if(i-d>0) i1=i-d; else i1=0; if(i+d<r) i2=i+d; else i2=r-1; if(j-d>0) j1=j-d; else j1=0; if(j+d<c) j2=j+d; else j2=c-1; if(sprinkles[i2][j2]-sprinkles[i1][j1]>=k) res++; } } } cout<<res<<endl; return 0; }
#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...