oj.uz

Submission #921539

# Submission time Handle Problem Language Result Execution time Memory
921539 2024-02-04T06:07:22 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 14 ms 17392 KB 
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define int long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define str string
#define pii pair<int,int>
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define mii map<int,int>
#define mll map<ll,ll>
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yess cout<<"Yes\n";
#define noo cout<<"No\n";
using namespace std;

#define maxn 1111111
#define mod  1000000007

void solve(){
    int n,m,k,l;
    cin>>n>>m>>k>>l;
    int pp[n+3][m+3];
    for(int i=0;i<=n;i++){
        pp[i][0]=0;
    }
    for(int i=0;i<=m;i++){
        pp[0][i]=0;
    }
    str s[n+3],d;
    for(int i=1;i<=n;i++){
        s[i]=" ";
        cin>>d;
        s[i]+=d;
        for(int j=1;j<=m;j++){
            pp[i][j]=(s[i][j]=='S');
            pp[i][j]+=pp[i-1][j];
            pp[i][j]+=pp[i][j-1];
            pp[i][j]-=pp[i-1][j-1];
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(s[i][j]!='M'){
                continue;
            }
            int l1,l2,r1,r2;
            l1=max(1ll,i-k);
            l2=min(n,i+k);
            r1=max(1ll,j-k);
            r2=min(m,j+k);
            int c=pp[l2][r2]-pp[l1-1][r2]-pp[l2][r1-1]+pp[l1-1][r1-1];
            if(c>=l){
                ans++;
            }
        }
    }
    cout<<ans;
}

signed main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	//srand( time(0));
	//freopen("sum.in", "r", stdin);
	//freopen("sum.out", "w", stdout);
    int tests=1;
    //cin>>tests;
    for(int i=1;i<=tests;i++){
		//cout<<"Case "<<i<<": \n";
		solve();
	}
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2136 KB Output is correct
2 Correct 2 ms 2136 KB Output is correct
3 Correct 3 ms 2648 KB Output is correct
4 Correct 2 ms 2140 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17136 KB Output is correct
2 Correct 11 ms 17136 KB Output is correct
3 Correct 14 ms 17096 KB Output is correct
4 Correct 11 ms 17104 KB Output is correct
5 Correct 14 ms 17392 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 2 ms 2136 KB Output is correct
17 Correct 2 ms 2136 KB Output is correct
18 Correct 3 ms 2648 KB Output is correct
19 Correct 2 ms 2140 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 12 ms 17136 KB Output is correct
22 Correct 11 ms 17136 KB Output is correct
23 Correct 14 ms 17096 KB Output is correct
24 Correct 11 ms 17104 KB Output is correct
25 Correct 14 ms 17392 KB Output is correct
26 Correct 7 ms 6492 KB Output is correct
27 Correct 5 ms 5168 KB Output is correct
28 Correct 5 ms 5464 KB Output is correct
29 Correct 5 ms 5468 KB Output is correct
30 Correct 7 ms 6236 KB Output is correct