oj.uz

답안 #830453

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830453 2023-08-19T06:43:06 Z ajay Collecting Mushrooms (NOI18_collectmushrooms) C++14
100 / 100
 35 ms 38432 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void solve()
{
    int r, c, d, k;
    cin >> r >> c >> d >> k;
    vvi mat(r + 5, vi(c + 5));
    vvi mushrooms;
    rep(i, 0, r)
    {
        string s;
        cin >> s;
        rep(j, 0, c)
        {
            if (s[j] == 'M')
                mushrooms.pb({i, j});
            else if (s[j] == 'S')
            {
                // 2d range update...
                mat[i][j] = 1;
            }
        }
    }

    rep(i, 0, r)
    {
        rep(j, 0, c)
        {
            if (i > 0)
                mat[i][j] += mat[i - 1][j];
            if (j > 0)
                mat[i][j] += mat[i][j - 1];
            if (i > 0 and j > 0)
                mat[i][j] -= mat[i - 1][j - 1];
        }
    }

    int ans = 0;
    rep(i, 0, sz(mushrooms))
    {
        int xx = mushrooms[i][0];
        int yy = mushrooms[i][1];
        int r1 = max(0, xx - d);
        int r2 = min(r - 1, xx + d);
        int c1 = max(0, yy - d);
        int c2 = min(c - 1, yy + d);
        int sum = mat[r2][c2];
        if (r1 - 1 >= 0)
            sum -= mat[r1 - 1][c2];
        if (c1 - 1 >= 0)
            sum -= mat[r2][c1 - 1];
        if (r1 - 1 >= 0 and c1 - 1 >= 0)
            sum += mat[r1 - 1][c1 - 1];
        if (sum >= k)
        {
            ans++;
        }
    }
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

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

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23344 KB Output is correct
2 Correct 32 ms 38432 KB Output is correct
3 Correct 35 ms 33572 KB Output is correct
4 Correct 21 ms 24060 KB Output is correct
5 Correct 33 ms 35796 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 708 KB Output is correct
16 Correct 2 ms 1244 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 2 ms 1580 KB Output is correct
19 Correct 2 ms 1356 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 19 ms 23344 KB Output is correct
22 Correct 32 ms 38432 KB Output is correct
23 Correct 35 ms 33572 KB Output is correct
24 Correct 21 ms 24060 KB Output is correct
25 Correct 33 ms 35796 KB Output is correct
26 Correct 14 ms 10904 KB Output is correct
27 Correct 18 ms 14464 KB Output is correct
28 Correct 11 ms 8708 KB Output is correct
29 Correct 10 ms 8072 KB Output is correct
30 Correct 17 ms 13884 KB Output is correct