Submission #347397

#	Time	Username	Problem	Language	Result	Execution time	Memory
347397		Kerim	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	7 ms	2548 KiB

ho_t2

#include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
char s[MAXN];
int par[MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n,k;
    scanf("%d%d",&n,&k);
    scanf("%s",s+1);
    vector<int>J,I;
    for(int i=1;i<=n;i++){
    	if(s[i]=='J')J.pb(i);
    	else if(s[i]=='I')I.pb(i);
    	else par[i]++;
    	par[i]+=par[i-1];
    }
    int ans=INF,j=int(I.size())-k,a=INF;
    for(int i=int(J.size())-1;i>=k-1;i--){
    	while(j>=0 and I[j]>J[i] and par[I[j]]-par[J[i]]>=k)umin(a,I[j+k-1]-I[j]+I[j]),j--;
    	if(a!=INF)umin(ans,J[i]-J[i-k+1]+1-J[i]+a);
    }
    if(ans==INF)puts("-1");
    else printf("%d\n",ans-3*k);
	return 0;
}

Compilation message (stderr)

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
ho_t2.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%s",s+1);
      |     ~~~~~^~~~~~~~~~

• Subtask 1: 1 / 1
• Subtask 2: 12 / 12
• Subtask 3: 87 / 87