Submission #321216

# Submission time Handle Problem Language Result Execution time Memory
321216 2020-11-11T14:46:57 Z fadi57 Collecting Mushrooms (NOI18_collectmushrooms) C++14
19 / 100
41 ms 5220 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;
}
    
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 36 ms 5220 KB Output is correct
2 Correct 35 ms 5220 KB Output is correct
3 Correct 35 ms 5220 KB Output is correct
4 Correct 41 ms 5220 KB Output is correct
5 Correct 41 ms 5220 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -