oj.uz

답안 #392037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392037 2021-04-20T10:21:24 Z strawberry2005 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 18 ms 12556 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
const int mod = 1e9+7;
#define deb(x) cout<<#x<<": "<<x<<endl

int iceil(int a, int b) {
  return (a + b - 1) / b;
}

int mul(int a, int b) {
    return a * 1ll * b % mod;
}

int binpow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = mul(res, a);
        a = mul(a, a);
        b >>= 1;
    }
    return res;
}
int ar[1001][1001];

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.precision(20);

    #ifdef strawberryshaker2005
        freopen("input.txt", "r", stdin);
    #endif

    int r,c,d,k;
    cin>>r>>c>>d>>k;
    char grid[r+1][c+1];
    for(int i=1;i<=r;i++) for(int j=1;j<=c;j++) cin>>grid[i][j];
    int diff[r+2][c+2];
    memset(diff,0,sizeof(diff));
    for(int i=1;i<=r;i++){
        for(int j=1;j<=c;j++){
            if(grid[i][j]=='S'){
                diff[max(1LL,i-d)][max(1LL,j-d)]++;
                diff[min(r,i+d)+1][min(c,j+d)+1]++;
                diff[min(r,i+d)+1][max(1LL,j-d)]--;
                diff[max(1LL,i-d)][min(c,j+d)+1]--;
            }
        }
    }
    for(int i=1;i<=r;i++){
        for(int j=1;j<=c;j++){
            diff[i][j]+=diff[i-1][j]+diff[i][j-1]-diff[i-1][j-1];
        }
    }
    int ans=0;
    for(int i=1;i<=r;i++){
        for(int j=1;j<=c;j++){
            if(diff[i][j]>=k&&grid[i][j]=='M') ans++;
        }
    }
    cout<<ans<<endl;

    

    return(0);
    
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1996 KB Output is correct
2 Correct 5 ms 2124 KB Output is correct
3 Correct 8 ms 2508 KB Output is correct
4 Correct 7 ms 2124 KB Output is correct
5 Correct 6 ms 2252 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12556 KB Output is correct
2 Correct 16 ms 12444 KB Output is correct
3 Correct 17 ms 12556 KB Output is correct
4 Correct 18 ms 12492 KB Output is correct
5 Correct 17 ms 12492 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 1996 KB Output is correct
17 Correct 5 ms 2124 KB Output is correct
18 Correct 8 ms 2508 KB Output is correct
19 Correct 7 ms 2124 KB Output is correct
20 Correct 6 ms 2252 KB Output is correct
21 Correct 17 ms 12556 KB Output is correct
22 Correct 16 ms 12444 KB Output is correct
23 Correct 17 ms 12556 KB Output is correct
24 Correct 18 ms 12492 KB Output is correct
25 Correct 17 ms 12492 KB Output is correct
26 Correct 13 ms 4924 KB Output is correct
27 Correct 13 ms 4756 KB Output is correct
28 Correct 13 ms 4812 KB Output is correct
29 Correct 13 ms 4856 KB Output is correct
30 Correct 13 ms 4812 KB Output is correct