oj.uz

Submission #649587

# Submission time Handle Problem Language Result Execution time Memory
649587 2022-10-10T21:45:15 Z ShahdMohamed Collecting Mushrooms (NOI18_collectmushrooms) C++17
38 / 100
 16 ms 4840 KB 
///LW M4 ACC HAZ3L GAMED
///YARAB WALA...I MEAN YARAB ACC
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
const ll mod = (ll) 1e9 + 7;
const ll even = (ll) 1e9 + 2;
const ll oo= (ll) 1e16;
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    ll n,m,x,y;
    cin>>n>>m>>x>>y;
    vector<vector<char>>v(n,vector<char>(m));
    for (ll i=0; i<n; i++)
    {
        for (ll j=0; j<m; j++)
            cin>>v[i][j];
    }
    vector<ll>frq(m+1);
    for (ll i=0; i<n; i++)
    {
        for (ll j=0; j<m; j++)
        {
            if (v[i][j]=='S')
            {
                frq[max(0ll,j-x)]++;
                frq[min(m,j+x+1)]--;
            }
        }
    }
    for (ll i=1; i<=m; i++)
        frq[i]+=frq[i-1];
    ll ans=0;
    for (ll i=0; i<n; i++)
    {
        for (ll j=0; j<m; j++)
        {
            if (v[i][j]=='M' and frq[j]>=y)ans++;
        }
    }
    cout<<ans<<endl;

    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 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 0 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 Incorrect 3 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 4712 KB Output is correct
2 Correct 11 ms 4840 KB Output is correct
3 Correct 12 ms 4800 KB Output is correct
4 Correct 16 ms 4760 KB Output is correct
5 Correct 15 ms 4828 KB Output is correct

Subtask #6
0 / 21.0

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