제출 #868637

#제출 시각아이디문제언어결과실행 시간메모리
868637imarnJJOOII 2 (JOI20_ho_t2)C++14
100 / 100
9 ms4176 KiB
#include<bits/stdc++.h> using namespace std; int main(){ int n,k;cin>>n>>k; string s;cin>>s; int dpj[n]; deque<int>dq; for(int i=0;i<n;i++){ if(s[i]=='J')dq.push_back(i); while(!dq.empty()&&dq.size()>k)dq.pop_front(); if(dq.size()==k)dpj[i]=i-dq.front()+1-k; else dpj[i]=-1; } int cnt=0; int idx=0; int dpo[n]; int ro[n]; for(int i=0;i<n;i++)ro[i]=-1; for(int i=0;i<n;i++){ if(s[i]=='O')cnt++; while(cnt==k){ if(s[idx]=='O')cnt--; ro[idx]=i,dpo[idx]=i-idx+1-k;idx++; } } int dpi[n];dq.clear(); dpi[n+1];dpi[n]=-1; for(int i=n-1;i>=0;i--){ if(s[i]=='I')dq.push_back(i); while(!dq.empty()&&dq.size()>k)dq.pop_front(); if(dq.size()==k)dpi[i]=dq.front()-i+1-k; else dpi[i]=-1; }int ans=1e9; for(int i=0;i<n-1;i++){ if(dpj[i]!=-1&&ro[i+1]!=-1&&ro[i+1]+1<n&&dpi[ro[i+1]+1]!=-1)ans=min(ans,dpj[i]+dpo[i+1]+dpi[ro[i+1]+1]); //cout<<dpj[i]<<" "<<ro[i+1]<<" "<<dpi[ro[i+1]+1]<<"\n"; }cout<<(ans==1e9?-1:ans); }

컴파일 시 표준 에러 (stderr) 메시지

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:10:37: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   10 |         while(!dq.empty()&&dq.size()>k)dq.pop_front();
      |                            ~~~~~~~~~^~
ho_t2.cpp:11:21: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 |         if(dq.size()==k)dpj[i]=i-dq.front()+1-k;
      |            ~~~~~~~~~^~~
ho_t2.cpp:27:12: warning: statement has no effect [-Wunused-value]
   27 |     dpi[n+1];dpi[n]=-1;
      |     ~~~~~~~^
ho_t2.cpp:30:37: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |         while(!dq.empty()&&dq.size()>k)dq.pop_front();
      |                            ~~~~~~~~~^~
ho_t2.cpp:31:21: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |         if(dq.size()==k)dpi[i]=dq.front()-i+1-k;
      |            ~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...