oj.uz

Submission #320986

# Submission time Handle Problem Language Result Execution time Memory
320986 2020-11-10T12:39:34 Z MarcoMeijer Collecting Mushrooms (NOI18_collectmushrooms) C++14
100 / 100
 18 ms 13332 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;

int r, c, d, k;
vector<vll> sm;
vector<string> gr;

int getSm(int i, int j) {
    if(i<0||j<0) return 0;
    return sm[i][j];
}

void program() {
    IN(r,c,d,k);
    gr.resize(r);
    RE(i,r) IN(gr[i]);
    sm.assign(r+1, vll(c+1,0));
    RE(i,r) RE(j,c) {
        if(gr[i][j] == 'S') {
            int x=i, y=j;
            int x1=max(0,x-d);
            int x2=min(r,x+d+1);
            int y1=max(0,y-d);
            int y2=min(c,y+d+1);
            sm[x1][y1]++;
            sm[x1][y2]--;
            sm[x2][y1]--;
            sm[x2][y2]++;
        }
    }
    RE(i,r) RE(j,c)
        sm[i][j] += getSm(i,j-1)+getSm(i-1,j)-getSm(i-1,j-1);
    int ans = 0;
    RE(i,r) RE(j,c) {
        if(gr[i][j] == 'M' && sm[i][j] >= k) {
            ans++;
        }
    }
    OUTL(ans);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2284 KB Output is correct
2 Correct 4 ms 2412 KB Output is correct
3 Correct 4 ms 2796 KB Output is correct
4 Correct 4 ms 2412 KB Output is correct
5 Correct 4 ms 2540 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13332 KB Output is correct
2 Correct 11 ms 13184 KB Output is correct
3 Correct 12 ms 13184 KB Output is correct
4 Correct 13 ms 13184 KB Output is correct
5 Correct 17 ms 13184 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 4 ms 2284 KB Output is correct
17 Correct 4 ms 2412 KB Output is correct
18 Correct 4 ms 2796 KB Output is correct
19 Correct 4 ms 2412 KB Output is correct
20 Correct 4 ms 2540 KB Output is correct
21 Correct 13 ms 13332 KB Output is correct
22 Correct 11 ms 13184 KB Output is correct
23 Correct 12 ms 13184 KB Output is correct
24 Correct 13 ms 13184 KB Output is correct
25 Correct 17 ms 13184 KB Output is correct
26 Correct 18 ms 7404 KB Output is correct
27 Correct 10 ms 5356 KB Output is correct
28 Correct 12 ms 5484 KB Output is correct
29 Correct 10 ms 5484 KB Output is correct
30 Correct 14 ms 6636 KB Output is correct