oj.uz

Submission #146966

# Submission time Handle Problem Language Result Execution time Memory
146966 2019-08-27T01:45:57 Z dongwon0427 Collecting Mushrooms (NOI18_collectmushrooms) C++14
19 / 100
 44 ms 32596 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;


int n,m,d,k;
vector<int> A[500005], S[500005];
char tmp[500005];
vector<pii> mush;

int cnt(int x1,int y1,int x2,int y2) {
    x2 = min(x2, n);
    y2 = min(y2, m);
    if(x1-1 < 0) {
        if(y1 - 1 < 0) {
            return S[x2][y2];
        } else return S[x2][y2] - S[x2][y1-1];
    } else if(y1 - 1 < 0) {
        return S[x2][y2] - S[x1-1][y2];
    }
    return S[x2][y2] - S[x1-1][y2] - S[x2][y1-1] + S[x1-1][y1-1];
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n>>m>>d>>k;

    for(int j=1;j<=n;j++) {
        cin>>tmp;
        int len = strlen(tmp);
        A[j].push_back(0);
        for(int i=0;i<len;i++) {
            A[j].push_back(0);
            if(tmp[i] == 'S') A[j].back() = 1;
            if(tmp[i] == 'M') {
                mush.push_back(pii(j,i));
            }
        }
    }

    for(int j=0;j<=m;j++) S[0].push_back(0);
    for(int i=1;i<=n;i++) {
        S[i].push_back(0);
        for(int j=1;j<=m;j++) {
            S[i].push_back(0);
            S[i][j] = A[i][j] + S[i-1][j] + S[i][j-1] - S[i-1][j-1];
        }
    }

    int ans = 0;
    for(pii p : mush) {
        ans += (cnt(p.first - d, p.second - d, p.first + d, p.second + d) >= k);
    }
    cout<<ans;
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 26 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 26 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 23 ms 23800 KB Output is correct
8 Correct 23 ms 23928 KB Output is correct
9 Correct 26 ms 23900 KB Output is correct
10 Correct 23 ms 23800 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 19.0

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

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 26 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23800 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 23 ms 23800 KB Output is correct
8 Correct 23 ms 23928 KB Output is correct
9 Correct 26 ms 23900 KB Output is correct
10 Correct 23 ms 23800 KB Output is correct
11 Incorrect 22 ms 23876 KB Output isn't correct
12 Halted 0 ms 0 KB -