답안 #321371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321371	2020-11-12T08:17:18 Z	techiehere08	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	18 / 100	38 ms	6628 KB

mushrooms

#include <bits/stdc++.h>

using namespace std;

int main(){
  int n, m, k, d, ans = 0;
  scanf("%d%d%d%d", &n, &m, &k, &d);
  int dp[n + 2][m + 2];
  char grid[n + 2][m + 2];
  memset(dp, 0, sizeof dp);
  for(int i = 1; i <= n; i++){
    //scanf("%s", &grid[i][1]);
    for(int j = 1; j <= m; j++){  
      //cout << grid[i][j] << " ";  
      cin >> grid[i][j];
      if(grid[i][j] != 'S'){
        continue;
      }
      //dp[max(1, i - d)][max(1, j - d)]++;
      //dp[max(1, i - d)][min(m, j + d) + 1]--;
      //dp[min(n, i + d) + 1][max(1, j - d)]--;
      //dp[min(n, i + d) + 1][min(m, j + d) + 1]++;
      
      dp[max(1, i - d)][max(1, j - d)]++;
      dp[min(n, i + d) + 1][max(1, j - d)]--;

      dp[max(1, i - d)][min(m, j + d) + 1]--;
      dp[min(n, i + d) + 1][min(m, j + d) + 1]++;
    }
     //cout << endl;
  }
  
  for(int i = 1; i <= n; i++){
    for(int j = 1; j <= m; j++){
      dp[i][j] += dp[i - 1][j];
    }
  }
  
  for(int i = 1; i <= n; i++){
    for(int j = 1; j <= m; j++){
      //dp[i][j] += dp[i - 1][j];
      dp[i][j] += dp[i][j - 1];
      if(grid[i][j] == 'M' && dp[i][j] >= k){
        ans++;
      }
    }
  }
  printf("%d", ans);
  return 0;
}

Compilation message

mushrooms.cpp: In function 'int main()':
mushrooms.cpp:7:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    7 |   scanf("%d%d%d%d", &n, &m, &k, &d);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
18.0 / 18.0

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