Submission #1173844

#TimeUsernameProblemLanguageResultExecution timeMemory
1173844ezzzayCollecting Mushrooms (NOI18_collectmushrooms)C++20
37 / 100
2096 ms12120 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back const int N=3e5+5; signed main(){ int n,m,d,k; cin>>n>>m>>d>>k; vector<vector<char>> a(n+3, vector<char>(m+3)); vector<vector<int>> cnt(n+3, vector<int>(m+3)); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ for(int y=1;y<=n;y++){ for(int x=1;x<=m;x++){ if(a[i][j]=='M' and a[y][x]=='S' and max(abs(y-i),abs(x-j))<=d)cnt[i][j]++; } } } } int p=0; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(cnt[i][j]>=k)p++; } } cout<<p; }
#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...