제출 #246153

#제출 시각아이디문제언어결과실행 시간메모리
246153SamAndCollecting Mushrooms (NOI18_collectmushrooms)C++17
19 / 100
18 ms13056 KiB
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 500005; int n, m, d, k; char** a; int** p; void solv() { scanf("%d%d%d%d", &n, &m, &d, &k); a = new char*[n + 5]; for (int i = 0; i < n + 5; ++i) a[i] = new char[m + 5]; for (int i = 1; i <= n; ++i) scanf(" %s", (a[i] + 1)); p = new int*[n + 5]; for (int i = 0; i < n + 5; ++i) { p[i] = new int [m + 5]; for (int j = 0; j < m + 5; ++j) p[i][j] = 0; } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (a[i][j] == 'S') { int x1 = max(1, i - d); int y1_ = max(1, j - d); int x2 = min(n, i + d); int y2 = min(m, i + d); p[x1][y1_]++; p[x1][y2 + 1]--; p[x2 + 1][y1_]--; p[x2 + 1][y2 + 1]++; } } } int ans = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { p[i][j] = p[i][j] + p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1]; if (a[i][j] == 'M') { if (p[i][j] >= k) ++ans; } } } printf("%d\n", ans); } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}

컴파일 시 표준 에러 (stderr) 메시지

mushrooms.cpp: In function 'void solv()':
mushrooms.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d", &n, &m, &d, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %s", (a[i] + 1));
         ~~~~~^~~~~~~~~~~~~~~~~~~
#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...