oj.uz

Submission #641933

# Submission time Handle Problem Language Result Execution time Memory
641933 2022-09-17T23:10:41 Z HibaKhalil Collecting Mushrooms (NOI18_collectmushrooms) C++14
38 / 100
 34 ms 5160 KB 
#include<bits/stdc++.h>

using namespace std;

int main (){
    int r,c,d,k;
    cin>>r>>c>>d>>k;
    char grid[r+1][c+1];
    for(int i=1;i<=r;i++) 
    {
        for(int j=1;j<=c;j++)
        {
            cin>>grid[i][j];
        }
    }
    int sprinkles[r+1][c+1];

    for (int i=0;i<=r;i++)
    {
        for (int j=0;j<=c;j++)
        {
            if(i==0 || j==0)
            {
                sprinkles[i][j]=0;
                continue;
            }
            sprinkles[i][j]=0;
            sprinkles[i][j]+=sprinkles[i-1][j];
            sprinkles[i][j]+=sprinkles[i][j-1];
            sprinkles[i][j]-=sprinkles[i-1][j-1];

            if(grid[i][j]=='S'){
                sprinkles[i][j]++;
            }
        }
    }

    int res = 0;

    for(int i=1;i<=r;i++)
    {
        for(int j=1;j<=c;j++)
        {
            if(grid[i][j]=='M'){
                int i1 , j1 , i2 , j2;
                if(i-d>0) i1=i-d;
                else i1=1;
                if(i+d<=r) i2=i+d;
                else i2=r;
                if(j-d>0) j1=j-d;
                else j1=1;
                if(j+d<=c) j2=j+d;
                else j2=c;
                int tmp=sprinkles[i1-1][j1]+sprinkles[i1][j1-1]-sprinkles[i1-1][j1-1];
              //  cout<<tmp<<" "<<sprinkles[i2][j2]<<endl;
                if(sprinkles[i2][j2]-tmp>=k) {
                    res++;
                }
            }
        }
    }

    cout<<res<<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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 12 ms 1236 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 34 ms 5068 KB Output is correct
2 Correct 32 ms 5104 KB Output is correct
3 Correct 34 ms 5160 KB Output is correct
4 Correct 32 ms 5076 KB Output is correct
5 Correct 32 ms 5108 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 0 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -