oj.uz

Submission #621132

# Submission time Handle Problem Language Result Execution time Memory
621132 2022-08-03T12:45:41 Z srivatsav_kannan Collecting Mushrooms (NOI18_collectmushrooms) C++14
38 / 100
 40 ms 9580 KB 
#include <iostream>
#include <iomanip>
#include <array>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <map>
#include <algorithm>
#include <numeric>
#include <stack>
#include <cstring>
#include <bitset>
#include <climits>
#include <valarray>
#include <list>
#include <functional>
#include <unordered_map>
#define int long long int
#define inf 100000000000
#define endl '\n'
#define mod 998244353
using namespace std;
signed main(){
    int r,c,d,k; cin >> r >> c >> d >> k;
    char ar[r+1][c+1];
    int val[r+1][c+1];
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            cin >> ar[i][j];
            val[i][j] = 0;
        }
    }
    for (int i = 0; i <= r; i++) val[i][0] = 0;
    for (int i = 0; i <= c; i++) val[0][i] = 0;
    
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            if (ar[i][j] != 'S') continue;
            int ci = max(i-d,1LL);
            int cj = max(j-d,1LL);
            if (ci >= 1 && cj >= 1) val[ci][cj]++;
            ci = max(i-d, 1LL);
            cj = j+d+1;
            if (ci >= 1 && cj <= c) val[ci][cj]--;
            ci = i+d+1;
            cj = j-d;
            if (ci <= r && cj >= 1) val[ci][cj]--;
            //            ci = min(i+d+1, r);
            //            cj = min(j+d+1, c);
            //            if (ci <= r && cj <= r) val[ci][cj]++;
        }
    }
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            val[i][j] += val[i-1][j];
            val[i][j] += val[i][j-1];
            val[i][j] -= val[i-1][j-1];
            val[i][j] = max(val[i][j], 0LL);
            //cout << val[i][j] << " ";
        }
        //cout << endl;
    }
    
    int cnt = 0;
    for (int i = 1; i <= r; i++){
        for (int j = 1; j <= c; j++){
            //if (i == 3 && j == 4) cout << ar[i][j] << " " << val[i][j] << endl;
            if (ar[i][j] == 'M' && val[i][j] >= k) cnt++;
        }
    }
    cout << cnt << endl;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 300 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2132 KB Output is correct
2 Incorrect 14 ms 2260 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 9464 KB Output is correct
2 Correct 36 ms 9504 KB Output is correct
3 Correct 40 ms 9568 KB Output is correct
4 Correct 39 ms 9556 KB Output is correct
5 Correct 37 ms 9580 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -