oj.uz

답안 #862425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862425 2023-10-18T08:12:59 Z Irate Collecting Mushrooms (NOI18_collectmushrooms) C++14
79 / 100
 2000 ms 4852 KB 
#include<bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, d, k;
    cin >> n >> m >> d >> k;
    vector<vector<char>>grid(n, vector<char>(m));
    vector<vector<int>>cnt(n, vector<int>(m));
    for(int i = 0;i < n;++i){
        for(int j = 0;j < m;++j){
            cin >> grid[i][j];
            if(grid[i][j] == 'S'){
                int x = max(i - d, 0);
                int y = max(j - d, 0);
                int x_end = min(i + d, n - 1);
                int y_end = min(j + d, m - 1);
                for(int i = x;i <= x_end;++i){
                    cnt[i][y] += 1;
                    if(y_end + 1 < m)cnt[i][y_end + 1] += -1;
                }
            }
        }
    }
    int res = 0;
    for(int i = 0;i < n;++i){
        int sum = 0;
        for(int j = 0;j < m;++j){
            sum += cnt[i][j];
            if(grid[i][j] == 'M' && sum >= k){
                res++;
            }
        }
    }
    cout << res;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

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

Subtask #5
19.0 / 19.0

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

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 1368 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 3 ms 1628 KB Output is correct
19 Correct 3 ms 1372 KB Output is correct
20 Correct 3 ms 1372 KB Output is correct
21 Correct 9 ms 4720 KB Output is correct
22 Correct 7 ms 4720 KB Output is correct
23 Correct 8 ms 4720 KB Output is correct
24 Correct 10 ms 4720 KB Output is correct
25 Correct 8 ms 4716 KB Output is correct
26 Execution timed out 2045 ms 4852 KB Time limit exceeded
27 Halted 0 ms 0 KB -