oj.uz

Submission #1006063

# Submission time Handle Problem Language Result Execution time Memory
1006063 2024-06-23T10:52:53 Z makanhulia Collecting Mushrooms (NOI18_collectmushrooms) C++17
42 / 100
 21 ms 24560 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"


signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n, m, d, s; cin >> n >> m >> d >> s;

    string grid[n + 5];

    for ( int i = 0; i < n; i++) cin >> grid[i];

    int ans[n + 5][m + 5];

    memset ( ans, 0, sizeof(ans));

    for ( int i = 0; i < n; i++){
        for ( int j = 0; j < m; j++){
            if ( grid[i][j] == 'S' ){
                int x1 = max ( 0ll, i - d), x2 = min ( m, i + d);
                int y1 = max ( 0ll, j - d ), y2 = min ( m, j + d);

                ans[x1][y1]++;
                
                if ( y2 + 1 <= m ) ans[x1][y2 + 1]--;
                if ( x2 + 1 <= n ) ans[x2 + 1][y1]--;
                if ( x2 + 1 <= n && y2 + 1 <= m ) ans[x2 + 1][y2 + 1]++;
            }
        }
    }

    int cnt = 0;

    for ( int i = 0; i < n; i++){
        for ( int j = 0; j < m; j++){
            if ( i - 1 >= 0 ){
                ans[i][j] += ans[i - 1][j];
            }
            if ( j - 1 >= 0 ){
                ans[i][j] += ans[i][j - 1];
            }
            if ( i - 1 >= 0 && j - 1 >= 0 ){
                ans[i][j] -= ans[i - 1][j - 1];
            }
        }
    }

    for ( int i = 0; i < n; i++){
        for ( int j = 0; j < m; j++){
            if ( grid[i][j] == 'M' ){
                if ( ans[i][j] >= s ) cnt++; 
            }
        }
    }

    cout << cnt << endl;
}

Subtask #1
0 / 9.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 344 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.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 344 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2140 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Correct 2 ms 2672 KB Output is correct
4 Correct 2 ms 2320 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 18 ms 24556 KB Output is correct
2 Correct 21 ms 24304 KB Output is correct
3 Correct 19 ms 24560 KB Output is correct
4 Correct 21 ms 24304 KB Output is correct
5 Correct 20 ms 24452 KB Output is correct

Subtask #6
0 / 21.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 344 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -