| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 921875 | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 12 ms | 9252 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
void solve(){
ll a,b,d,k;
cin>>a>>b>>d>>k;
char c[a+1][b+1];
ll pr[a+1][b+1];
for(ll i=1;i<=a;i++){
for(ll j=1;j<=b;j++){
cin>>c[i][j];
pr[i][j]=(c[i][j]=='S')+pr[i-1][j]+pr[i][j-1]-pr[i-1][j-1];
}
}
ll ans=0;
for(ll i=1;i<=a;i++){
for(ll j=1;j<=b;j++){
if(c[i][j]=='M'){
ll l1=0,r1=0,l2=0,r2=0;
l1=max(1ll,i-d);
r1=max(1ll,j-d);
l2=min(a,i+d);
r2=min(b,j+d);
ll count=pr[l2][r2]-pr[l2][r1-1]-pr[l1-1][r2]+pr[l1-1][r1-1];
if(count>=k){
ans++;
}
}
}
}
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
ll t=1,i=1;
//cin>>t;
while(t--){
//cout<<"Case ";
//cout<<i<<':'<<"\n";
//i++;
solve();
}
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... | ||||
