oj.uz

Submission #321223

# Submission time Handle Problem Language Result Execution time Memory
321223 2020-11-11T15:05:14 Z fadi57 Collecting Mushrooms (NOI18_collectmushrooms) C++14
38 / 100
 38 ms 4836 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx=5*1e5+6;
const int mod= 998244353;
const ll inf=2*1e16+9;
int r,c,d,k;
char a[mx];

ll pref[mx];
int get(int i){
    
    int sum=0;
    int right=min(c-1,i+d);
    int left=max(0,i-d);
    sum=pref[right];
    if(left==0){return sum;}return (sum-pref[left-1]);
}
int main() {
cin>>r>>c>>d>>k;
if(r==1){
    ll ans=0;
    for(int i=0;i<c;i++){
       
        cin>>a[i];
        if(a[i]=='S'){
            pref[i]++;
        }
        if(i!=0){pref[i]+=pref[i-1];}
        
    } for(int i=0;i<c;i++){
       
      int sum=0;
        if(a[i]=='M'){
           sum=get(i); 
        }
        if(sum>=k){ans++;}//
        //cout<<pref[i];
     
    } 
    cout<<ans;return 0;
}
if(d==max(r,c)){
    int mushrom=0;int s=0;
    for(int i=0;i<r;i++){
        for(int j=0;j<c;j++){
            char x;
            cin>>x;
            mushrom+=(x=='M');
            s+=(x=='S');
        }
    }
    if(s>=k){cout<<mushrom;}else{cout<<0;}
    return 0;
}
    
}

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 364 KB Output is correct
3 Correct 1 ms 364 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 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 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 38 ms 4708 KB Output is correct
2 Correct 35 ms 4708 KB Output is correct
3 Correct 37 ms 4836 KB Output is correct
4 Correct 36 ms 4708 KB Output is correct
5 Correct 36 ms 4708 KB Output is correct

Subtask #6
0 / 21.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 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Incorrect 0 ms 364 KB Output isn't correct
12 Halted 0 ms 0 KB -