oj.uz

답안 #995404

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995404 2024-06-09T03:19:41 Z cpptowin Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 19 ms 24412 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define inf (int)1e18
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int n,m,d,k;
vector<vi> a,b;
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> d >> k;
    a.resize(n + 5);
    b.resize(n + 5);
    fo(i,0,n + 4) a[i].resize(m + 5,0),b[i].resize(m + 5,0);
    fo(i,1,n) fo(j,1,m)
    {
        char t;
        cin >> t;
        if(t == 'M') a[i][j] = 1;
        if(t == 'S')
        {
            int l = max(i - d,1),r = max(j - d,1),u = min(i + d,n + 1),v = min(j + d,m + 1);
            b[l][r]++;
            b[l][v + 1]--;
            b[u + 1][r]--;
            b[u + 1][v + 1]++;
        }
    }
    fo(i,1,n) fo(j,1,m) b[i][j] += b[i][j - 1] + b[i - 1][j] - b[i - 1][j - 1];
    int ans = 0;
    fo(i,1,n) fo(j,1,m) if(a[i][j] == 1 and b[i][j] >= k) ans++;
    cout << ans;
}

Compilation message

mushrooms.cpp:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main()
      | ^~~~
mushrooms.cpp: In function 'int main()':
mushrooms.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 348 KB Output is correct
6 Correct 0 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 1 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 1 ms 348 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

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

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 23900 KB Output is correct
2 Correct 16 ms 23892 KB Output is correct
3 Correct 18 ms 24408 KB Output is correct
4 Correct 19 ms 24412 KB Output is correct
5 Correct 18 ms 24412 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 348 KB Output is correct
6 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 432 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 1884 KB Output is correct
17 Correct 3 ms 2140 KB Output is correct
18 Correct 4 ms 2652 KB Output is correct
19 Correct 3 ms 2140 KB Output is correct
20 Correct 4 ms 2392 KB Output is correct
21 Correct 18 ms 23900 KB Output is correct
22 Correct 16 ms 23892 KB Output is correct
23 Correct 18 ms 24408 KB Output is correct
24 Correct 19 ms 24412 KB Output is correct
25 Correct 18 ms 24412 KB Output is correct
26 Correct 14 ms 7204 KB Output is correct
27 Correct 9 ms 4956 KB Output is correct
28 Correct 11 ms 5212 KB Output is correct
29 Correct 10 ms 5212 KB Output is correct
30 Correct 12 ms 6492 KB Output is correct