oj.uz

Submission #621202

# Submission time Handle Problem Language Result Execution time Memory
621202 2022-08-03T14:19:38 Z srivatsav_kannan Collecting Mushrooms (NOI18_collectmushrooms) C++14
100 / 100
 41 ms 9096 KB 
#include <iostream>
#include <iomanip>
#include <array>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <map>
#include <algorithm>
#include <numeric>
#include <stack>
#include <cstring>
#include <bitset>
#include <climits>
#include <valarray>
#include <list>
#include <functional>
#include <unordered_map>
#define int long long int
#define inf 100000000000
#define endl '\n'
#define mod 998244353
using namespace std;
signed main(){
    int r,c,d,k; cin >> r >> c >> d >> k;
    char a[r+1][c+1];
    int pre[r+1][c+1];
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            cin >> a[i][j];
        }
    }
    for (int i = 0; i <= r; i++){
        for (int j = 0; j <= c; j++) pre[i][j] = 0;
    }
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            pre[i][j] = (pre[i-1][j]+pre[i][j-1]+(a[i][j] == 'S'))-pre[i-1][j-1];
        }
    }
    int cnt = 0;
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            if (a[i][j] != 'M') continue;
            int u = max(i-d,1LL);
            int v = max(j-d, 1LL);
            int w = min(i+d, r);
            int x = min(j+d, c);
            int cur = pre[w][x]-pre[u-1][x]-pre[w][v-1]+pre[u-1][v-1];
            if (cur >= k) cnt++;
        }
    }
    cout << cnt << endl;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2032 KB Output is correct
2 Correct 15 ms 2096 KB Output is correct
3 Correct 17 ms 2748 KB Output is correct
4 Correct 13 ms 2228 KB Output is correct
5 Correct 14 ms 2388 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 9096 KB Output is correct
2 Correct 41 ms 9080 KB Output is correct
3 Correct 40 ms 9044 KB Output is correct
4 Correct 37 ms 9044 KB Output is correct
5 Correct 34 ms 9044 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 13 ms 2032 KB Output is correct
17 Correct 15 ms 2096 KB Output is correct
18 Correct 17 ms 2748 KB Output is correct
19 Correct 13 ms 2228 KB Output is correct
20 Correct 14 ms 2388 KB Output is correct
21 Correct 37 ms 9096 KB Output is correct
22 Correct 41 ms 9080 KB Output is correct
23 Correct 40 ms 9044 KB Output is correct
24 Correct 37 ms 9044 KB Output is correct
25 Correct 34 ms 9044 KB Output is correct
26 Correct 34 ms 5084 KB Output is correct
27 Correct 35 ms 5084 KB Output is correct
28 Correct 36 ms 5232 KB Output is correct
29 Correct 33 ms 5244 KB Output is correct
30 Correct 35 ms 5096 KB Output is correct