oj.uz

Submission #1021321

# Submission time Handle Problem Language Result Execution time Memory
1021321 2024-07-12T16:57:17 Z lamagril Collecting Mushrooms (NOI18_collectmushrooms) C++14
37 / 100
 151 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
    cin.tie(NULL)->sync_with_stdio(false);
    int n,m,d,k; cin >> n >> m >> d >> k;
    char mp[n+5][m+5];
    int v[n+d+5][m+d+5],qs[n+d+5][m+d+5];
    for(int i=0 ; i<=n ; i++){
        for(int j=0 ; j<=m ; j++){
            v[i][j]=0;
            qs[i][j]=0;
        }
    }
    int ans=0;
    for(int i=1 ; i<=n ; i++){
        for(int j=1 ; j<=m ; j++){
            cin >> mp[i][j];
        }
    }
    for(int i=1 ; i<=n ; i++){
        for(int j=1 ; j<=m ; j++){
            if(mp[i][j]=='S'){
                v[max(1,i-d)][max(1,j-d)]++;
                if(j+d+1<=n) v[max(1,i-d)][j+d+1]--;
                if(i+d+1<=n) v[i+d+1][max(1,j-d)]--;
                if(i+d+1<=n && j+d+1<=n) v[i+d+1][j+d+1]++;
            }
        }
    }
    for(int i=1 ; i<=n ; i++){
        for(int j=1 ; j<=m ; j++){
            qs[i][j]=qs[i-1][j]+qs[i][j-1]-qs[i-1][j-1]+v[i][j];
        }
    }
    for(int i=1 ; i<=n ; i++){
        for(int j=1 ; j<=m ; j++){
            if(mp[i][j]=='M'){
                if(qs[i][j]>=k) ans++;
            }
        }
    }
    cout << ans << '\n';
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6236 KB Output is correct
2 Correct 5 ms 4184 KB Output is correct
3 Correct 6 ms 3416 KB Output is correct
4 Incorrect 5 ms 5832 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 151 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 6 ms 6236 KB Output is correct
17 Correct 5 ms 4184 KB Output is correct
18 Correct 6 ms 3416 KB Output is correct
19 Incorrect 5 ms 5832 KB Output isn't correct
20 Halted 0 ms 0 KB -