Submission #970422

#TimeUsernameProblemLanguageResultExecution timeMemory
970422NoMercyCollecting Mushrooms (NOI18_collectmushrooms)C++17
0 / 100
28 ms13240 KiB
#include <bits/stdc++.h> using namespace std; int TIME = clock(); #define file \ freopen("in.txt" , "r" , stdin); \ freopen("out.txt" , "w" , stdout); void test_case () { int n , m , d , k; cin >> n >> m >> d >> k; char c[n][m]; vector<vector<int>> pre(n + 2 , vector<int> (m + 2 , 0)); for (int i = 0;i < n;i ++) { for (int j = 0;j < m;j ++) { cin >> c[i][j]; } } for (int i = 1;i <= n;i ++) { for (int j = 1;j <= m;j ++) { if (c[i - 1][j - 1] == 'S') { pre[max(0 , i - d)][max(0 , j - d)] ++; pre[min(n + 1 , i + d + 1)][min(m + 1 , j + d + 1)] ++; pre[min(n + 1 , i + d + 1)][max(0 , j - d)] --; pre[max(0 , i - d)][min(m + 1 , j + d + 1)] --; } } } for (int i = 0;i <= n;i ++) { for (int j = 0;j <= m;j ++) { if (i > 0) { pre[i][j] += pre[i - 1][j]; } if (j > 0) { pre[i][j] += pre[i][j - 1]; } if (i > 0 && j > 0) { pre[i][j] -= pre[i - 1][j - 1]; } } } // for (int i = 1;i <= n;i ++) { // for (int j = 1;j <= m;j ++) { // cout << pre[i][j] << " "; // } // cout << "\n"; // } int res = 0; for (int i = 1;i <= m;i ++) { for (int j = 1;j <= m;j ++) { res += bool(c[i - 1][j - 1] == 'M' && pre[i][j] >= k); } } cout << res << "\n"; } /* ....... ....... ....... ....... ....... */ int32_t main () { //// file int t = 1; // cin >> t; while (t --) { test_case(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...