이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define DIM 200010
using namespace std;
int sp_j[DIM],sp_i[DIM],sp_o[DIM],cnt_left[DIM],cnt_right[DIM];
char v[DIM];
int n,k,i;
int main (){
//ifstream cin ("date.in");
//ofstream cout ("date.out");
cin>>n>>k>>v+1;
for (i=1;i<=n;i++){
sp_j[i] = sp_j[i-1] + (v[i] == 'J');
sp_o[i] = sp_o[i-1] + (v[i] == 'O');
sp_i[i] = sp_i[i-1] + (v[i] == 'I');
}
/// cnt_left[i] - nr minim de caractere pe care trebuie sa le sterg a.i sa am k de J
for (i=1;i<=n;i++){
int st = 1, dr = i, sol = -1;
while (st <= dr){
int mid = (st+dr)>>1;
if (sp_j[i] - sp_j[mid-1] >= k){
sol = mid;
st = mid+1;
} else dr = mid-1;
}
if (sol == -1)
cnt_left[i] = -1;
else cnt_left[i] = i - sol + 1 - k;
}
/// cnt_right[i] - sa am k de I de la poz i in dreapta
for (i=1;i<=n;i++){
int st = i, dr = n, sol = -1;
while (st <= dr){
int mid = (st+dr)>>1;
if (sp_i[mid] - sp_i[i-1] >= k){
sol = mid;
dr = mid-1;
} else st = mid+1;
}
if (sol == -1)
cnt_right[i] = -1;
else cnt_right[i] = sol - i + 1 - k;
}
int ans = n+1;
for (i=1;i<=n;i++){
if (cnt_right[i] == -1)
continue;
int st = 1, dr = i-1, sol = -1;
while (st <= dr){
int mid = (st+dr)>>1;
if (sp_o[i-1] - sp_o[mid-1] >= k){
sol = mid;
st = mid+1;
} else dr = mid-1;
}
if (sol != -1 && cnt_left[sol-1] != -1)
ans = min (ans, cnt_right[i] + cnt_left[sol-1] + i-1 - sol + 1 - k);
}
if (ans == n+1)
cout<<-1;
else cout<<ans;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
ho_t2.cpp: In function 'int main()':
ho_t2.cpp:13:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
cin>>n>>k>>v+1;
~^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |