oj.uz

Submission #548711

# Submission time Handle Problem Language Result Execution time Memory
548711 2022-04-14T10:24:44 Z Mazaalai Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 23 ms 29336 KB 
#include <bits/stdc++.h>
// #define int long long
using namespace std;

#define _upgrade                  \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORB(i, a, b) for (int i = a; i >= b; i--)
#define REP(i, a) for (int i = 0; i < a; i++)
#define REP1(i, a) for (int i = 1; i < a; i++)
#define REPB(i, a) for (int i = a - 1; i >= 0; i--)
#define TRAV(a,x) for (auto& a: x)
#define LINE "---------------------\n"
#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
#define Q queue
#define ff first
#define ss second
#define ts to_string
#define pb push_back
#define mp make_pair
#define lb lower_bound 
#define ub upper_bound 
#define sz(x) (int)x.size()

using ll = long long;
using db = double;
using ld = long double;
using uint = unsigned;
// PQ going up <int, VI, greater<int> >
using VI = vector<int>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VD = vector<db>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
using VPI = vector<PII>;
using VVPI = vector<VPI>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void eraseDups(VI& a) {
    a.erase(unique(a.begin(), a.end()), a.end());
}
int strToInt(string&a) {
    stringstream x(a);
    int b;
    x >> b;
    return b;
}
int bitCnt(int a) {
    bitset <64> b(a);
    return b.count();
}
int bitCnt(string a) {
    bitset <64> b(a);
    return b.count();
}

int gcd(int a, int b) {
   if (b == 0) return a;
   return gcd(b, a % b);
}

void print(VI& a) {
    for (auto el : a) {
        cout << el << ' ';
    }
    cout << '\n';
}
void print(VPI& a) {
    for (auto el : a) {
        cout << el.ff << ',' << el.ss << ' ';
    }
    cout << '\n';
}

void print(VI& a, int n) {
    int cnt = 0;
    for (auto el : a) {
        if (cnt++ == n) break;
        cout << el << ' ';
    }
    cout << '\n';
}
void print(VVI& a) {
    for (auto el : a) {
        print(el);
    }
}

/*

|                    _                                                     
|  __   _           | |                                                    
| |   \| | ___  ___ | |_                                                   
| | |\ | |/ _ \/ __/| __|                                                  
| | | \  |  __/\__ \| |_                                                   
| |_|  \_|\___ /___/ \__|                                                  
|                                                      _         _   _     
|                                                     (_)       | | | |    
|  _ __  _ __ ___   __ _ _ __ __ _ _ __ ___  _ __ ___  _ ___ ___| |_| |_   
| | '_ \| '__/ _ \ / _` | '__/ _` | '_ ` _ \| '_ ` _ \| / __/ __| __| __|  
| | |_) | | | (_) | (_| | | | (_| | | | | | | | | | | | \__ \__ \ |_| |_   
| | .__/|_|  \___/ \__, |_|  \__,_|_| |_| |_|_| |_| |_|_|___/___/\__|\__|  
| | |               __/ |                                                  
| |_|              |___/                   _                               
|                                  _      (_)                              
|  _ __ ___   __ _ ____ __ _  __ _| | __ _ _                               
| | '_ ` _ \ / _` |_   / _` |/ _` | |/ _` | |                              
| | | | | | | (_|  /  / (_| | (_| | | (_| | |                              
| |_| |_| |_|\__,_|____\__,_|\__,_|_|\__,_|_|                              
*/

const db PI = acos(-1.0); //M_PI;
const ll INFF = 4e18;
const int INF = 1.07e9;
const int MOD = 1e9 + 7;
const int MOD1 = 998244353; //7*19*2^23 +1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};





const int N = 5e5 + 5;
const int M = 2e5 + 5;

int nums[N];

int n, m, k, q, r;
string s[N];
void go () {
    cin >> n >> m >> r >> k;
    int sum[n+5][m+5];
    memset(sum, 0, sizeof(sum));
    for (int i = 1; i <= n; i++) {
    	cin >> s[i];
    	s[i] = "."+s[i];
    	for (int j = 1; j <= m; j++) {
    		if (s[i][j] == 'S') { // splinker
    			int x1 = max(1, i - r);
    			int y1 = max(1, j - r);
    			int x2 = min(n, i + r);
    			int y2 = min(m, j + r);
    			sum[x1][y1]++;
    			sum[x1][y2+1]--;
    			sum[x2+1][y1]--;
    			sum[x2+1][y2+1]++;
    			// cout << i << " " << j << ": " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << '\n'; 
    		}
    	}
    }
	
    // for (int i = 0; i <= 1+n; i++) {
    // 	for (int j = 0; j <= 1+m; j++) {
    // 		cout << setw(2) << sum[i][j] << " \n"[j==m+1];
    // 	}
    // }
    for (int i = 1; i <= n; i++) {
    	// for (int j = 1; j <= m; j++) {
    	// 	cout << sum[i][j] << " \n"[j==m];
    	// }
    	for (int j = 1; j <= m; j++) {
    		sum[i][j] += sum[i][j-1];
    	}
    	for (int j = 1; j <= m; j++) {
    		sum[i][j] += sum[i-1][j];
    		// cout << sum[i][j] << " \n"[j==m];
    	}
    }
    // for (int i = 0; i <= 1+n; i++) {
    // 	for (int j = 0; j <= 1+m; j++) {
    // 		cout << setw(2) << sum[i][j] << " \n"[j==m+1];
    // 	}
    // }
    int ans = 0;
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
    	ans += (s[i][j] == 'M' && sum[i][j]>= k);
    	// if (s[i][j] == 'M') {
    	// 	cout << i <<" " << j << ": " << sum[i][j] << "\n";
    	// }
    }
    cout << ans << "\n";
}



signed main () {

#ifndef ONLINE_JUDGE
    // freopen("0.in", "r", stdin);
    // freopen("0.out", "w", stdout);
#endif
    _upgrade
    int T = 1;
    while(T--) go();
    return (0-0); //<3
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    
*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15956 KB Output is correct
2 Correct 9 ms 16000 KB Output is correct
3 Correct 9 ms 15956 KB Output is correct
4 Correct 9 ms 15992 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15956 KB Output is correct
2 Correct 9 ms 16000 KB Output is correct
3 Correct 9 ms 15956 KB Output is correct
4 Correct 9 ms 15992 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 9 ms 15956 KB Output is correct
7 Correct 9 ms 15956 KB Output is correct
8 Correct 8 ms 15956 KB Output is correct
9 Correct 11 ms 15988 KB Output is correct
10 Correct 9 ms 15956 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15872 KB Output is correct
2 Correct 9 ms 15956 KB Output is correct
3 Correct 9 ms 15956 KB Output is correct
4 Correct 11 ms 15992 KB Output is correct
5 Correct 10 ms 15956 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 17108 KB Output is correct
2 Correct 13 ms 17156 KB Output is correct
3 Correct 11 ms 17408 KB Output is correct
4 Correct 10 ms 17108 KB Output is correct
5 Correct 11 ms 17236 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 28864 KB Output is correct
2 Correct 19 ms 29240 KB Output is correct
3 Correct 20 ms 29280 KB Output is correct
4 Correct 21 ms 29224 KB Output is correct
5 Correct 21 ms 29336 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15956 KB Output is correct
2 Correct 9 ms 16000 KB Output is correct
3 Correct 9 ms 15956 KB Output is correct
4 Correct 9 ms 15992 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 9 ms 15956 KB Output is correct
7 Correct 9 ms 15956 KB Output is correct
8 Correct 8 ms 15956 KB Output is correct
9 Correct 11 ms 15988 KB Output is correct
10 Correct 9 ms 15956 KB Output is correct
11 Correct 9 ms 15872 KB Output is correct
12 Correct 9 ms 15956 KB Output is correct
13 Correct 9 ms 15956 KB Output is correct
14 Correct 11 ms 15992 KB Output is correct
15 Correct 10 ms 15956 KB Output is correct
16 Correct 12 ms 17108 KB Output is correct
17 Correct 13 ms 17156 KB Output is correct
18 Correct 11 ms 17408 KB Output is correct
19 Correct 10 ms 17108 KB Output is correct
20 Correct 11 ms 17236 KB Output is correct
21 Correct 23 ms 28864 KB Output is correct
22 Correct 19 ms 29240 KB Output is correct
23 Correct 20 ms 29280 KB Output is correct
24 Correct 21 ms 29224 KB Output is correct
25 Correct 21 ms 29336 KB Output is correct
26 Correct 18 ms 19924 KB Output is correct
27 Correct 15 ms 18876 KB Output is correct
28 Correct 15 ms 19204 KB Output is correct
29 Correct 18 ms 19080 KB Output is correct
30 Correct 21 ms 19376 KB Output is correct