# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006077 | andecaandeci | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 26 ms | 20428 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 fi first
#define se second
using namespace std;
int main()
{
int r, c, d, p, ans=0;
scanf("%d %d %d %d", &r, &c, &d, &p);
char s[r+5][c+5];
int pref[r+5][c+5];
vector<pair<int, int> >v;
memset(pref, 0, sizeof(pref));
for(int i=1; i<=r; i++)
{
for(int j=1; j<=c; j++)
{
scanf("%c", &s[i][j]);
if(s[i][j]=='M')
{
v.push_back({i, j});
}
if(s[i][j]=='S')pref[i][j]++;
pref[i][j]+=(pref[i-1][j]+pref[i][j-1]);
}
}
for(int i=0; i<v.size(); i++)
{
if(pref[min(r, v[i].fi+d)][min(c, v[i].se+d)]-pref[max(0, v[i].fi-d-1)][min(c, v[i].se+d)]-pref[min(r, v[i].fi+d)][max(0, v[i].se-d-1)]+pref[max(0, v[i].fi-d-1)][max(0, v[i].se-d-1)]>=p)
{
ans++;
}
}
printf("%d\n", ans);
}
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... |